Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081075
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081075 Fibonacci(4n+2)-3. +0
1
5, 52, 374, 2581, 17708, 121390, 832037, 5702884, 39088166, 267914293, 1836311900, 12586269022, 86267571269, 591286729876, 4052739537878, 27777890035285, 190392490709132, 1304969544928654, 8944394323791461 (list; graph; listen)
OFFSET

1,1

REFERENCES

Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75

FORMULA

a(n) = 8a(n-1)-8a(n-2)+a(n-3)

MAPLE

with(combinat): for n from 1 to 40 do printf(`%d, `, fibonacci(4*n+2)-3) od:

CROSSREFS

Cf. A000045 (Fibonacci numbers).

Sequence in context: A134097 A067282 A045539 this_sequence A134111 A071583 A099881

Adjacent sequences: A081072 A081073 A081074 this_sequence A081076 A081077 A081078

KEYWORD

nonn,easy

AUTHOR

R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Mar 04, 2003

EXTENSIONS

More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 05, 2003

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 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research