The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160243 a(n) = Lucas(n+1) + prime(n). 1
 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, 30633378, 33385431, 54018672 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Lucas(n) = A000032(n), prime(n) = A000040(n). LINKS EXAMPLE a(1) = Lucas(2) + prime(1) = 3 + 2 = 5. a(4) = Lucas(5) + prime(4) = 11 + 7 = 18. 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 A000032 (Lucas numbers, beginning at 2), A000040 (primes), A096362 (order in which prime factors first occur in the Lucas sequence), A160244 (A000285(n) + A000040(n)). Sequence in context: A314311 A031144 A314312 * A247027 A020686 A011984 Adjacent sequences:  A160240 A160241 A160242 * A160244 A160245 A160246 KEYWORD easy,nonn AUTHOR Enoch Haga, May 05 2009 EXTENSIONS Edited by Klaus Brockhaus, May 20 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 08:27 EDT 2020. Contains 336293 sequences. (Running on oeis4.)