[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A158780 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A158780 a(2n) = A131577(n), a(2n+1) = A011782(n).
(history; published version)
#25 by Bruno Berselli at Sun May 14 02:10:21 EDT 2023
STATUS

reviewed

approved

#24 by Michel Marcus at Sun May 14 02:02:30 EDT 2023
STATUS

proposed

reviewed

#23 by Stefano Spezia at Sat May 13 16:36:50 EDT 2023
STATUS

editing

proposed

#22 by Stefano Spezia at Sat May 13 15:53:05 EDT 2023
DATA

0, 1, 1, 1, 2, 2, 4, 4, 8, 8, 16, 16, 32, 32, 64, 64, 128, 128, 256, 256, 512, 512, 1024, 1024, 2048, 2048, 4096, 4096, 8192, 8192, 16384, 16384, 32768, 32768, 65536, 65536, 131072, 131072, 262144, 262144, 524288, 524288, 1048576, 1048576, 2097152, 2097152, 4194304

#21 by Stefano Spezia at Sat May 13 15:50:59 EDT 2023
FORMULA

E.g.f.: (2*cosh(sqrt(2)*x) + sqrt(2)*sinh(sqrt(2)*x) + 2*x - 2)/4. - Stefano Spezia, May 13 2023

STATUS

approved

editing

#20 by Joerg Arndt at Thu Apr 20 02:10:48 EDT 2023
STATUS

reviewed

approved

#19 by Michel Marcus at Thu Apr 20 01:10:09 EDT 2023
STATUS

proposed

reviewed

#18 by Jon E. Schoenfield at Wed Apr 19 23:47:53 EDT 2023
STATUS

editing

proposed

#17 by Jon E. Schoenfield at Wed Apr 19 23:47:50 EDT 2023
FORMULA

a(n) = (1/2)*(2^Floorfloor(n/2) + [n=1] - [n=0]). - G. C. Greubel, Apr 19 2023

STATUS

proposed

editing

#16 by G. C. Greubel at Wed Apr 19 23:44:19 EDT 2023
STATUS

editing

proposed

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 08:01 EDT 2024. Contains 375510 sequences. (Running on oeis4.)