Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081005
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081005 Fibonacci(4n+3)+1, or Fibonacci(2n+1)*Lucas(2n+2). +0
1
3, 14, 90, 611, 4182, 28658, 196419, 1346270, 9227466, 63245987, 433494438, 2971215074, 20365011075, 139583862446, 956722026042, 6557470319843, 44945570212854, 308061521170130, 2111485077978051, 14472334024676222 (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)+1) od:

CROSSREFS

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

Sequence in context: A038170 A007840 A007549 this_sequence A074518 A088789 A029767

Adjacent sequences: A081002 A081003 A081004 this_sequence A081006 A081007 A081008

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research