login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134596 The largest n-digit primeval number A072857. 6
2, 37, 137, 1379, 13679, 123479, 1234679, 12345679, 102345679, 1123456789, 10123456789 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Former definition: The least n-digit number m (i.e., m >= 10^(n-1)) which yields A076730(n) = the maximum, for m < 10^n, of A039993(m) = number of primes that can be formed using some or all digits of m.
Subsequence of A072857 consisting of the largest terms of given length. - M. F. Hasler, Mar 12 2014
LINKS
FORMULA
a(n) = max { m in A072857, m < 10^n }. - M. F. Hasler, Mar 12 2014
PROG
(PARI) A134596(n, A=A072857)=vecmax(select(t->logint(t, 10)+1==n, A)) \\ where A072857 must comprise all n digit terms of that sequence. - M. F. Hasler, Oct 14 2019
(Python) # see linked program in A076449
CROSSREFS
Sequence in context: A262182 A142077 A107182 * A139119 A244757 A298476
KEYWORD
nonn,base,more
AUTHOR
N. J. A. Sloane, Jan 25 2008
EXTENSIONS
Link fixed by Charles R Greathouse IV, Aug 13 2009
Definition reworded and values of a(6)-a(11) added by M. F. Hasler, Mar 11 2014
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 14:52 EDT 2024. Contains 372003 sequences. (Running on oeis4.)