Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081069 Lucas(4n)+2, or Lucas(2n)^2. +0
1
4, 9, 49, 324, 2209, 15129, 103684, 710649, 4870849, 33385284, 228826129, 1568397609, 10749957124, 73681302249, 505019158609, 3461452808004, 23725150497409, 162614600673849, 1114577054219524, 7639424778862809 (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)

a(n)=2+[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Dec 01 2008]

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) od:

CROSSREFS

Cf. A000032 (Lucas numbers).

Sequence in context: A068809 A110481 A030088 this_sequence A053967 A028945 A082875

Adjacent sequences: A081066 A081067 A081068 this_sequence A081070 A081071 A081072

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 November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research