Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081012
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081012 Fibonacci(4n+1)-2, or Fibonacci(2n+2)*Lucas(2n-1). +0
1
3, 32, 231, 1595, 10944, 75023, 514227, 3524576, 24157815, 165580139, 1134903168, 7778742047, 53316291171, 365435296160, 2504730781959, 17167680177563, 117669030460992, 806515533049391, 5527939700884755, 37889062373143904 (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 0 to 25 do printf(`%d, `, fibonacci(4*n+1)-2) od

CROSSREFS

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

Adjacent sequences: A081009 A081010 A081011 this_sequence A081013 A081014 A081015

Sequence in context: A004256 A002059 A028447 this_sequence A035533 A029502 A037792

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research