|
|
|
|
|
|
|
|
|
#11 by Susanna Cuyler at Mon Dec 10 16:44:17 EST 2018
|
|
|
|
|
|
|
|
#10 by Amiram Eldar at Mon Dec 10 13:57:11 EST 2018
|
|
|
|
|
|
|
|
#9 by Amiram Eldar at Mon Dec 10 13:57:08 EST 2018
|
|
| MATHEMATICA
|
a[0] = 1; a[1] = 3; a[n_] := a[n] = Module[{s = a[n - 1] + a[n - 2]}, Do[p = 10^d*s; While[! PrimeQ[p], p = NextPrime[p]]; If[Floor[p/10^d] == s, Break[]], {d, 1, 20}]; p]; Array[a, 10, 0] (* Amiram Eldar, Dec 10 2018 from the Maple code *)
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#8 by Michel Marcus at Mon Dec 10 13:35:49 EST 2018
|
|
|
|
|
|
|
|
#7 by Michel Marcus at Mon Dec 10 13:35:40 EST 2018
|
|
| NAME
|
a(0) =) = 1, a(1) = 3, a(n) = smallest prime beginning with the sum of two previous terms.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#6 by Robert Israel at Mon Dec 10 13:32:55 EST 2018
|
|
|
|
|
|
|
|
#5 by Robert Israel at Mon Dec 10 13:32:45 EST 2018
|
|
| LINKS
|
Robert Israel, <a href="/A087544/b087544.txt">Table of n, a(n) for n = 0..322</a>
|
|
| MAPLE
|
A[0]:= 1: A[1]:= 3:
for n from 2 to 20 do
s:= A[n-2]+A[n-1];
for d from 1 do
p:= nextprime(10^d*s);
if floor(p/10^d)=s then A[n]:= p; break fi
od
od:
seq(A[n], n=0..20); # Robert Israel, Dec 10 2018
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#4 by N. J. A. Sloane at Thu Dec 05 19:56:31 EST 2013
|
|
| AUTHOR
|
_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Sep 13 2003
|
|
|
|
|
Discussion
|
| Thu Dec 05
| 19:56
| OEIS Server: https://oeis.org/edit/global/2075
|
|
|
|
|
|
|
#3 by Russ Cox at Fri Mar 30 17:29:08 EDT 2012
|
|
| EXTENSIONS
|
More terms from _Ray Chandler (rayjchandler(AT)sbcglobal.net), _, Sep 23 2003
|
|
|
|
|
Discussion
|
| Fri Mar 30
| 17:29
| OEIS Server: https://oeis.org/edit/global/154
|
|
|
|
|
|
|
#2 by N. J. A. Sloane at Fri Jan 12 03:00:00 EST 2007
|
|
| KEYWORD
|
base,nonn,new
|
|
| EXTENSIONS
|
More terms from Ray Chandler (RayChandlerrayjchandler(AT)alumni.tcusbcglobal.edunet), Sep 23 2003
|
|
|
|
|
|
