Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081011
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081011 Fibonacci(4n+3)+2, or Fibonacci(2n+3)*Lucas(2n). +0
1
4, 15, 91, 612, 4183, 28659, 196420, 1346271, 9227467, 63245988, 433494439, 2971215075, 20365011076, 139583862447, 956722026043, 6557470319844, 44945570212855, 308061521170131, 2111485077978052, 14472334024676223 (list; graph; listen)
OFFSET

0,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 0 to 25 do printf(`%d, `, fibonacci(4*n+3)+2) od

CROSSREFS

Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).

Sequence in context: A034496 A079155 A076900 this_sequence A008829 A013193 A040025

Adjacent sequences: A081008 A081009 A081010 this_sequence A081012 A081013 A081014

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 03, 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 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research