Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003115 a(0) = a(1) = 1; for n >= 2, a(n)=a(n-1)*4^[n/2]-a(n-2). +0
1
1, 1, 3, 11, 173, 2757, 176275, 11278843, 2887207533, 739113849605, 756849694787987, 775013348349049083, 3174453917988010255981, 13002562473065541659449093, 213033980384251916560403683731 (list; graph; listen)
OFFSET

0,3

REFERENCES

D. H. Lehmer, Course on History of Mathematics, Univ. Calif. Berkeley, 1973.

FORMULA

a(n+2) = (4^(n+1) - 5)*a(n) - 4a(n-2).

PROGRAM

(PARI) a(n)=if(n<2, n >= 0, 4^(n\2)*a(n-1)-a(n-2))

CROSSREFS

Sequence in context: A080987 A132561 A006485 this_sequence A053888 A118479 A103836

Adjacent sequences: A003112 A003113 A003114 this_sequence A003116 A003117 A003118

KEYWORD

nonn,easy

AUTHOR

njas, Herman P. Robinson

EXTENSIONS

More terms from Michael Somos, Aug 23, 2000.

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research