|
|
|
|
|
|
|
|
|
#14 by OEIS Server at Wed Aug 31 09:12:40 EDT 2016
|
|
| LINKS
|
Dana Jacobsen, <a href="/A276199/b276199_1.txt">Table of n, a(n) for n = 1..997</a> (first 28 terms from José Eduardo Gaboardi de Carvalho)
|
|
|
|
|
|
|
#13 by Bruno Berselli at Wed Aug 31 09:12:40 EDT 2016
|
|
|
|
|
|
Discussion
|
| Wed Aug 31
| 09:12
| OEIS Server: Installed new b-file as b276199.txt. Old b-file is now b276199_1.txt.
|
|
|
|
|
|
|
#12 by Joerg Arndt at Wed Aug 31 08:05:44 EDT 2016
|
|
|
|
|
|
|
|
#11 by Dana Jacobsen at Tue Aug 30 18:52:07 EDT 2016
|
|
|
|
|
|
|
|
#10 by Dana Jacobsen at Tue Aug 30 18:51:32 EDT 2016
|
|
| LINKS
|
Dana Jacobsen, <a href="/A276199/b276199_1.txt">Table of n, a(n) for n = 1..997</a>> (first 28 terms from José Eduardo Gaboardi de Carvalho)
|
|
|
|
|
|
|
#9 by Dana Jacobsen at Tue Aug 30 18:50:34 EDT 2016
|
|
| LINKS
|
José Eduardo Gaboardi deDana CarvalhoJacobsen, <a href="/A276199/b276199_1.txt">Table of n, a(n) for n = 1..28997</a>
|
|
| PROG
|
(Perl) use ntheory ":all"; sub a276199 { my $l=shift; my $p="3".substr(Pi($l+20), 2, $l-1); for my $dig (0 .. 20) { my $add = "0" x $dig; do { return "$p$add" if is_prime("$p$add"); } while length(++$add) == $dig; } } # Dana Jacobsen, Aug 30 2016
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#8 by N. J. A. Sloane at Mon Aug 29 20:56:21 EDT 2016
|
|
|
|
|
|
|
|
#7 by Michel Marcus at Wed Aug 24 12:41:57 EDT 2016
|
|
|
|
|
|
|
|
#6 by Michel Marcus at Wed Aug 24 12:41:35 EDT 2016
|
|
|
|
|
|
|
|
#5 by Michel Marcus at Wed Aug 24 12:40:20 EDT 2016
|
|
| NAME
|
Smallest prime that begins with at least n digits of piPi.
|
|
| EXAMPLE
|
a(7) = 314159207, begins with first 7 digits of piPi = 3.141592653...
|
|
| KEYWORD
|
nonn,base,changed
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
