[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a120827 -id:a120827
     Sort: relevance | references | number | modified | created      Format: long | short | data
Indices of primes in A057137.
+0
11
171, 277, 367, 561, 567, 18881
OFFSET
1,1
COMMENTS
Digits are in ascending order beginning with 1 and after 9 comes 0.
Indices of primes in A057137.
All terms must end in 1 or 7: A057137(n) is even when n is even, and divisible by 3 iff n == 0, 2, 3, 5, 6, 8 or 9 (mod 10). - M. F. Hasler, Apr 14 2024
REFERENCES
Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 61, 298.
EXAMPLE
a(1) = 12345678901234567890...01234567890...012345678901 = A057137(171) is the first prime term in A057137.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 10000}]; lst
IntegerLength[Select[Table[FromDigits[PadRight[{}, n, {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}]], {n, 1, 1001, 2}], PrimeQ]] (* Harvey P. Dale, Feb 07 2024 *)
PROG
(PARI) N=0; for(n=1, 600, if(ispseudoprime(N=10*N+n%10), print1(n", "))) \\ Charles R Greathouse IV, May 10 2014 (Comment: Surprisingly, this is faster than calling ispseudoprime() only when n ends in 1 or 7, even when much larger N's are considered, e.g., up to 3000. - M. F. Hasler, Apr 14 2024)
KEYWORD
base,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
EXTENSIONS
18881 from Arjen K. Lenstra, Feb 20 2012
STATUS
approved
Primes with n consecutive ascending digits beginning with the digit three.
+0
9
OFFSET
1,2
COMMENTS
Digits are in ascending order beginning with 3 and after 9 comes 0.
The sequence "Primes with n consecutive descending digits beginning with the digit three" has only one term, 1 which represents the prime 3.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[2+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 10000}]; lst
KEYWORD
base,bref,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved
Number of digits of the smallest prime with n consecutive ascending digits and most significant digit a five.
+0
9
1, 29, 269, 689
OFFSET
1,2
COMMENTS
Digits are in ascending order beginning with 5 and after 9 comes 0.
The sequence "Primes with n consecutive digits descending beginning with the digit five" has only one term, 1 which represents the prime 5.
EXAMPLE
29 is a term since the 29-digit number 56789012345678901234567890123 is a prime.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[4+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 9000}]; lst
KEYWORD
base,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved
Primes with n consecutive digits ascending beginning with the digit two.
+0
8
1, 2, 8, 82, 118, 158, 2122, 2242, 2388
OFFSET
1,2
COMMENTS
Digits are in ascending order beginning with 2 and after 9 comes 0.
The sequence "Primes with n consecutive digits descending beginning with the digit two" has only one term, 1 which represents the prime 2.
EXAMPLE
8 is a term since 23456789 is a prime.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[1+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 10000}]; lst
KEYWORD
base,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved
Primes with n consecutive ascending digits beginning with the digit four.
+0
8
OFFSET
1,1
COMMENTS
Digits are in ascending order beginning with 4; after 9 comes 0.
EXAMPLE
8 is a term since 45678901 is a prime.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[3+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 10000}]; lst
KEYWORD
base,bref,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved
Primes with n consecutive digits ascending beginning with the digit six.
+0
8
2, 6, 36, 122, 336
OFFSET
1,1
COMMENTS
Digits are in ascending order beginning with 6 and after 9 comes 0.
The sequence "Primes with n consecutive digits descending beginning with the digit six" has no terms.
EXAMPLE
6 is a term since 678901 is a prime.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[5+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 5000}]; lst
KEYWORD
base,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved
Number of digits of primes with n consecutive digits ascending beginning with the digit seven.
+0
8
OFFSET
1,2
COMMENTS
Digits are in ascending order beginning with 7 and after 9 comes 0.
The sequence "Primes with n consecutive digits descending beginning with the digit seven" has only two terms below 6001, namely 1 and 5, which represent the primes 7 and 76543, respectively.
EXAMPLE
1 is here because 7 is prime.
5 is here because 78901 is prime.
15 is here because 789012345678901 is a prime.
51 is here because 789012345678901234567890123456789012345678901234567 is prime.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[6+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 5000}]; lst
KEYWORD
base,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved
Primes with n consecutive digits ascending beginning with the digit eight.
+0
8
OFFSET
1,1
COMMENTS
Digits are in ascending order beginning with 8 and after 9 comes 0.
The sequence "Primes with n consecutive digits descending beginning with the digit eight" has no terms.
EXAMPLE
2 is a term since 89 is a prime.
MATHEMATICA
fQ[n_] := PrimeQ@ FromDigits@ Mod[7+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 5000}]; lst
KEYWORD
base,bref,hard,nonn
AUTHOR
Robert G. Wilson v, Jul 05 2006
STATUS
approved

Search completed in 0.007 seconds