Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129097
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129097 a(n) = A129095(2^n - 1) for n>=1. +0
5
1, 3, 11, 51, 323, 3075, 47427, 1230787, 54772163, 4247022531, 582413946819, 143061847179203, 63604391931367363, 51621812365091401667, 77028054123935294320579, 212592144046864728487817155 (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, A129098, A129099.

Sequence in context: A113712 A056199 A007047 this_sequence A014510 A058799 A054362

Adjacent sequences: A129094 A129095 A129096 this_sequence A129098 A129099 A129100

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research