login
This site is supported by donations 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 (list; graph; refs; listen; history; 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.

PROG

(PARI)

CROSSREFS

Cf. A129095, A129096, A129097, A129099.

Sequence in context: A009321 A078509 A077240 * A047049 A020034 A128884

Adjacent sequences:  A129095 A129096 A129097 * A129099 A129100 A129101

KEYWORD

easy,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Apr 11 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.