cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A340222 Constant whose decimal expansion is the concatenation of the largest n-digit semiprime A098450(n), for n = 1, 2, 3, ...

Original entry on oeis.org

9, 9, 5, 9, 9, 8, 9, 9, 9, 8, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 7, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 7, 9, 9, 9, 9, 9, 9, 9, 9, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
Offset: 0

Views

Author

M. F. Hasler, Jan 01 2021

Keywords

Examples

			The smallest prime with 1, 2, 3, 4, ... digits is, respectively, 9 = 3^2, 95 = 5*19, 998 = 2*499, 9998 = 2*4999, .... Here we list the sequence of digits of these numbers: 9: 9, 5; 9, 9, 8; 9, 9, 9, 8; ...
This can be considered, as for the Champernowne and Copeland-Erdős constants, as the decimal expansion of a real constant 0.9959989998...
		

Crossrefs

Cf. A098450 (largest n-digit semiprime), A340221 (similar, with smallest semiprime, limit of A215647), A340207 (same for squares, limit of A339978), A340206 (similar, with smallest n-digit squares, limit of A215689), A340209 (same with cubes, limit of A340115), A340208 (similar, with smallest n-digit cubes, limit of A215692), A340220 (same for primes, limit of A338968), A340219 (similar for smallest n-digit primes, limit of A215641).
Cf. A033307 (Champernowne constant), A030190 (binary), A001191 (concatenation of all squares), A134724 (cubes), A033308 (primes: Copeland-Erdős constant).

Programs

  • PARI
    concat([digits(A098450(k))|k<-[1..14]]) \\ as seq. of digits
    c(N=20)=sum(k=1,N,.1^(k*(k+1)/2)*A098450(k)) \\ as constant

Formula

c = 0.995998999899998999997999999899999997999999991999999999799999999997...
= Sum_{k >= 1} 10^(-k(k+1)/2)*A098450(k)
a(-n(n+1)/2) = 9 for all n >= 0, followed by increasingly more 9s.

A215685 Smallest prime whose decimal expansion consists of the concatenation of a 2-digit emirp, a 3-digit emirp, a 4-digit emirp, ..., and an n-digit emirp (A006567).

Original entry on oeis.org

13, 13337, 131071021, 13107100910711, 13107100910007100483, 131071009100071000491000187, 13107100910007100049100003310000657, 13107100910007100049100003310000169100007543, 131071009100071000491000033100001691000000071000015351
Offset: 2

Views

Author

Jonathan Vos Post, Aug 20 2012

Keywords

Comments

If a(n) exists it has A000217(n)-1 digits.

Examples

			a(2) = 13 which is a prime, and whose decimal digits reversed, 31, is also a prime.
a(3) = 13337, which is a prime, and the concatenation of 13 (an emirp) and 337 (an emirp because 733 is also a prime). It happens that the digital reversal of a(3), 73331, is also prime, so that 13337 is an emirp, but that is not a requirement for this sequence.
Note that a(4) is a prime but not an emirp, because 12070131 = 3 * 61 * 65957.
		

Crossrefs

Extensions

More terms from Alois P. Heinz, Aug 22 2012
Previous Showing 11-12 of 12 results.