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!)
A129098 a(n) = A129095(2^n + 2^(n-1) - 1) for n>=1. 4
1, 5, 23, 135, 1119, 14319, 300015, 10636463, 652217135, 70382845743, 13551477257519, 4706105734658351, 2973879284783561007, 3444999327807280048431, 7362415635261959807011119, 29188908702092573515760044335 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
b(n)=A129095(n) obeys the recurrence: b(n) = b(n/2) (n even), b(n) = 2*b(n-1) + b(n-2) (n odd >1), with b(1) = 1.
LINKS
MATHEMATICA
Block[{e = 18, s}, s = Nest[Append[#1, If[EvenQ[#2], #1[[#2/2]], 2 #1[[-1]] + #1[[-2]] ] ] & @@ {#, Length@ # + 1} &, {1}, 2^e]; Array[s[[2^# + 2^(# - 1) - 1]] &, e - 1]] (* Michael De Vlieger, Mar 10 2020 *)
PROG
(PARI)
CROSSREFS
Sequence in context: A281231 A356010 A244786 * A047049 A351817 A352146
KEYWORD
easy,nonn
AUTHOR
Paul D. Hanna, Apr 11 2007
EXTENSIONS
a(16) from Michael De Vlieger, Mar 10 2020.
STATUS
approved

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 July 13 08:08 EDT 2024. Contains 374274 sequences. (Running on oeis4.)