Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129098
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129098 a(n) = A129095(2^n + 2^(n-1) - 1) for n>=1. +0
5
1, 5, 23, 135, 1119, 14319, 300015, 10636463, 652217135, 70382845743, 13551477257519, 4706105734658351, 2973879284783561007, 3444999327807280048431, 7362415635261959807011119 (list; graph; listen)
OFFSET

1,2

COMMENT

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.

PROGRAM

(PARI)

CROSSREFS

Cf. A129095, A129096, A129097, A129099.

Sequence in context: A009321 A078509 A077240 this_sequence A047049 A020034 A128884

Adjacent sequences: A129095 A129096 A129097 this_sequence A129099 A129100 A129101

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research