|
|
A160243
|
|
a(n) = Lucas(n+1) + prime(n).
|
|
2
|
|
|
5, 7, 12, 18, 29, 42, 64, 95, 146, 228, 353, 558, 884, 1407, 2254, 3624, 5837, 9410, 15194, 24547, 39676, 64158, 103765, 167850, 271540, 439305, 710750, 1149958, 1860607, 3010462, 4870974, 7881327, 12752180, 20633378, 33385431, 54018672, 87403960, 141422487
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = Lucas(2) + prime(1) = 3 + 2 = 5.
a(4) = Lucas(5) + prime(4) = 11 + 7 = 18.
|
|
MATHEMATICA
|
Table[LucasL[n+1]+Prime[n], {n, 40}] (* Harvey P. Dale, May 25 2021 *)
|
|
PROG
|
(UBASIC) 10 'Lucas variations (change value of A in line 30 as appropriate) 20 P=1 30 A=2 40 B=1 50 C=A+B:print C; :R=nxtprm(P):print R; :P=R:print C+R 51 if C=prmdiv(C) then print C; "*":U=U+1 52 if C+R=prmdiv(C+R) then print C+R; "#":V=V+1 60 D=B+C:print D; :R=nxtprm(P):print R; :P=R:print D+R 61 if D=prmdiv(D) then print D; "*":U=U+1 62 if D+R=prmdiv(D+R) then print D+R; "#":V=V+1 63 print U; V 70 stop 80 A=C:B=D:goto 50
(Magma) [ Lucas(n+1)+NthPrime(n): n in [1..40] ]; // Klaus Brockhaus, May 20 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|