login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129097 a(n) = A129095(2^n - 1) for n>=1. 4
1, 3, 11, 51, 323, 3075, 47427, 1230787, 54772163, 4247022531, 582413946819, 143061847179203, 63604391931367363, 51621812365091401667, 77028054123935294320579, 212592144046864728487817155 (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

Table of n, a(n) for n=1..16.

MATHEMATICA

Block[{e = 16, s}, s = Nest[Append[#1, If[EvenQ[#2], #1[[#2/2]], 2 #1[[-1]] + #1[[-2]] ] ] & @@ {#, Length@ # + 1} &, {1}, 2^e]; Array[s[[2^# - 1]] &, e]] (* Michael De Vlieger, Mar 10 2020 *)

PROG

(PARI)

CROSSREFS

Cf. A129095, A129096, A129098, A129099.

Sequence in context: A007047 A182176 A244754 * A319155 A292927 A179322

Adjacent sequences:  A129094 A129095 A129096 * A129098 A129099 A129100

KEYWORD

easy,nonn

AUTHOR

Paul D. Hanna, Apr 11 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 15 12:14 EST 2021. Contains 340187 sequences. (Running on oeis4.)