|
Search: id:A064723
|
|
|
| A064723 |
|
(L(p)-1)/p where L() are the Lucas numbers (A000032) and p runs through the primes. |
|
+0
2
|
|
| 1, 1, 2, 4, 18, 40, 210, 492, 2786, 39650, 97108, 1459960, 9030450, 22542396, 141358274, 2249412290, 36259245522, 91815545800, 1500020153484, 9702063416738, 24704432285040, 409634464205812, 2672366681180466
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,100
|
|
FORMULA
|
a(n) = A006206(A000040(n)) - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Nov 04 2005
|
|
EXAMPLE
|
a(0) = (Lucas(2) - 1)/2 = (3 - 1)/2 = 1; a(3) = (Lucas(7) - 1)/7 = (29 - 1)/7 = 4.
|
|
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 50 do printf(`%d, `, (luc(ithprime(n)) - 1 ) / ithprime(n)) od:
|
|
PROGRAM
|
(PARI): lucas(n) = if(n==0, 2, if(n==1, 1, fibonacci(n+1)+fibonacci(n-1))) forprime(n=1, 100, print1((lucas(n)-1)/n, " "))
(PARI) lucas(n)= { if(n==0, 2, if(n==1, 1, fibonacci(n + 1) + fibonacci(n - 1))) } { n=-1; forprime (p=2, prime(101), write("b064723.txt", n++, " ", (lucas(p) - 1)/p) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 23 2009]
|
|
CROSSREFS
|
L(0)=2, L(1)=1.
Cf. A000032.
Cf. A006206.
Sequence in context: A054300 A063101 A143533 this_sequence A151449 A045664 A106520
Adjacent sequences: A064720 A064721 A064722 this_sequence A064724 A064725 A064726
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Shane Findley (TTpi314159(AT)cs.com), Oct 13 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 16 2001
|
|
|
Search completed in 0.002 seconds
|
