Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081067 Lucas(4n+2)+2, or 5*Fibonacci(2n+1)^2. +0
3
5, 20, 125, 845, 5780, 39605, 271445, 1860500, 12752045, 87403805, 599074580, 4106118245, 28143753125, 192900153620, 1322157322205, 9062201101805, 62113250390420, 425730551631125, 2918000611027445, 20000273725560980 (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

luc := proc(n) option remember: if n=0 then RETURN(2) fi: if n=1 then RETURN(1) fi: luc(n-1)+luc(n-2): end: for n from 0 to 40 do printf(`%d, `, luc(4*n+2)+2) od:

CROSSREFS

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

Sequence in context: A028944 A054720 A110373 this_sequence A024066 A009569 A061964

Adjacent sequences: A081064 A081065 A081066 this_sequence A081068 A081069 A081070

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


AT&T Labs Research