Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081078
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081078 Lucas(4n)-3, or Lucas(2n-1)*Lucas(2n+1). +0
1
4, 44, 319, 2204, 15124, 103679, 710644, 4870844, 33385279, 228826124, 1568397604, 10749957119, 73681302244, 505019158604, 3461452807999, 23725150497404, 162614600673844, 1114577054219519, 7639424778862804 (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)

a(n)=-3+(7/2)*{[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n}+(3/2)*sqrt(5)*{[(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 1 to 40 do printf(`%d, `, luc(4*n)-3) od:

CROSSREFS

Cf. A000032 (Lucas numbers).

Adjacent sequences: A081075 A081076 A081077 this_sequence A081079 A081080 A081081

Sequence in context: A077435 A074751 A129551 this_sequence A035014 A030987 A043039

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 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research