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.

Showing 1-6 of 6 results.

A340219 Constant whose decimal expansion is the concatenation of the smallest n-digit prime A003617(n), for n = 1, 2, 3, ...

Original entry on oeis.org

2, 1, 1, 1, 0, 1, 1, 0, 0, 9, 1, 0, 0, 0, 7, 1, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 1, 9, 1, 0, 0, 0, 0, 0, 0, 0, 7, 1, 0, 0, 0, 0, 0, 0, 0, 0, 7, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 7, 1, 0, 0, 0
Offset: 0

Views

Author

M. F. Hasler, Jan 01 2021

Keywords

Comments

The terms of sequence A215641 converge to this sequence of digits, and to this constant, up to powers of 10.

Examples

			The smallest prime with 1, 2, 3, 4, ... digits is, respectively, 2, 11, 101, 1009, .... Here we list the sequence of digits of these numbers: 2: 1, 1; 1, 0, 1; 1, 0, 0, 9; ...
This can be considered, as for the Champernowne and Copeland-Erdős constants, as the decimal expansion of a real constant 0.2111011009...

Crossrefs

Cf. A003617 (smallest n-digit prime), A215641 (has this as "limit"), A340206 (same for squares, limit of A215689), A340207 (similar, with largest n-digit squares, limit of A339978), A340208 (same for cubes, limit of A215692), A340209 (same with largest n-digit cube, limit of A340115), A340221 (same for semiprimes, limit of A215647).
Cf. A033307 (Champernowne constant), A030190 (binary), A001191 (concatenation of all squares), A134724 (cubes), A033308 (primes: Copeland-Erdős constant).

Programs

  • Mathematica
    Flatten[Table[IntegerDigits[NextPrime[10^n]],{n,0,20}]] (* Harvey P. Dale, Mar 29 2024 *)
  • PARI
    concat([digits(nextprime(10^k))|k<-[0..14]]) \\ as seq. of digits
c(N=20)=sum(k=1,N,.1^(k*(k+1)/2)*nextprime(10^(k-1))) \\ as constant

Formula

c = 0.21110110091000710000310000031000001910000000710000000071000000001...
= Sum_{k >= 1} 10^(-k(k+1)/2)*nextprime(10^(k-1))
a(-n(n+1)/2) = 1 for all n >= 2, followed by increasingly more zeros.

A340221 Constant whose decimal expansion is the concatenation of the smallest n-digit semiprime A098449(n), for n = 1, 2, 3, ...

Original entry on oeis.org

4, 1, 0, 1, 0, 6, 1, 0, 0, 3, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 6, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

M. F. Hasler, Jan 01 2021

Keywords

Comments

The terms of sequence A215647 converge to this sequence of digits, and to this constant, up to powers of 10.

Examples

			The smallest prime with 1, 2, 3, 4, ... digits is, respectively, 2, 11, 101, 1009, .... Here we list the sequence of digits of these numbers: 2: 1, 1; 1, 0, 1; 1, 0, 0, 9; ...
This can be considered, as for the Champernowne and Copeland-Erdős constants, as the decimal expansion of a real constant 0.2111011009...

Crossrefs

Cf. A098449 (smallest n-digit semiprime), A215647 (has this as "limit"), A340206 (same for squares, limit of A215689), A340207 (similar, with largest n-digit squares, limit of A339978), A340208 (same for cubes, limit of A215692), A340209 (same with largest n-digit cube, limit of A340115), A340219 (same for 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(A098449(k))|k<-[1..14]]) \\ as seq. of digits
c(N=20)=sum(k=1,N,.1^(k*(k+1)/2)*A098449(k)) \\ as constant

Formula

c = 0.410106100310001100001100000110000001100000001100000000610000000003...
= Sum_{k >= 1} 10^(-k(k+1)/2)*A098449(k)
a(-n(n+1)/2) = 1 for all n >= 2, followed by increasingly more zeros.

A340209 Constant whose decimal expansion is the concatenation of the largest n-digit cube A061435(n), for n = 1, 2, 3, ...

Original entry on oeis.org

8, 6, 4, 7, 2, 9, 9, 2, 6, 1, 9, 7, 3, 3, 6, 9, 7, 0, 2, 9, 9, 9, 9, 3, 8, 3, 7, 5, 9, 9, 8, 9, 7, 3, 4, 4, 9, 9, 7, 0, 0, 2, 9, 9, 9, 9, 9, 9, 3, 9, 4, 8, 2, 6, 4, 9, 9, 9, 6, 1, 9, 4, 6, 7, 2, 1, 9, 9, 9, 7, 0, 0, 0, 2, 9, 9, 9, 9, 9, 9, 9, 9, 5
Offset: 0

Views

Author

M. F. Hasler, Jan 01 2021

Keywords

Comments

The terms of sequence A340115 converge to this sequence of digits, and to this constant, up to powers of 10.

Examples

			The largest cube with 1, 2, 3, 4, ... digits is, respectively, 8 = 2^3, 64 = 4^3, 729 = 9^3, 9261 = 21^3, ..., cf. A061435.
Here we list the sequence of digits of these numbers: 8; 6, 4; 7, 2, 9; 9, 2, 6, 1; ...
This can be considered, as for the Champernowne and Copeland-Erdős constants, as the decimal expansion of a real constant 0.864729926...

Crossrefs

Cf. A061435 (largest n-digit cube), A340115 (has this as "limit"), A340208 (similar, with smallest n-digit cubes, limit of A215692), A340207 (same for squares, limit of A339978), A340220 (same for primes), A340222 (same for semiprimes), A340219 (similar, with smallest primes, limit of A215641), A340221 (similar, with smallest semiprimes, limit of A215647).
Cf. A033307 (Champernowne constant), A030190 (binary), A001191 (concatenation of all squares), A134724 (cubes), A033308 (primes: Copeland-Erdős constant).

Programs

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

Formula

c = 0.86472992619733697029999383759989734499700299999939482649996194672...
= Sum_{k >= 1} 10^(-k(k+1)/2)*floor(10^(k/3)-1)^3
a(-n(n+1)/2) = 9 for all n >= 3;

A340206 Constant whose decimal expansion is the concatenation of the smallest n-digit square A061432(n), for n = 1, 2, 3, ...

Original entry on oeis.org

1, 1, 6, 1, 0, 0, 1, 0, 2, 4, 1, 0, 0, 0, 0, 1, 0, 0, 4, 8, 9, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 4, 5, 6, 9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 4, 1, 2, 9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 4, 7, 9, 8, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 1, 4, 9, 2, 8, 4, 1, 0, 0, 0, 0
Offset: 0

Views

Author

M. F. Hasler, Dec 31 2020

Keywords

Comments

The terms of sequence A215689 have this as limit, digit-wise and as a constant, up to powers of 10.
Every other "smallest n-digit square" (i.e., for odd n = 2k + 1) is 10^k, which explains the chunks of (1,0,...,0), cf. formula.

Examples

			The smallest square with 1, 2, 3, 4, ... digits is, respectively, 1, 16 = 4^2, 100 = 10^2, 1024 = 32^2, ....
Here we list the digits of these numbers: 1; 1, 6; 1, 0, 0; 1, 0, 2, 4; ...
As for the Champernowne and Copeland-Erdős constants, we can consider this as the decimal expansion of the real constant 0.116100102410000100489...

Crossrefs

Cf. A061432 (smallest n-digit squares), A215689 (has this as "limit"), A340207 (same for largest n-digit squares), A340208 (same for cubes), A340219 (same for primes), A340221 (same for semiprimes).
Cf. A033307 (Champernowne constant), A030190 (binary), A001191 (concatenation of all squares), A134724 (cubes), A033308 (primes: Copeland-Erdős constant).

Programs

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

Formula

c = 0.11610010241000010048910000001000456910000000010000141291000000000010...
= Sum_{k >= 1} 10^(-k(k+1)/2)*ceiling(10^((k-1)/2))^2
a(-n(n+1)/2) = 1 for all n >= 0; a(k) = 0 for -n(n-1)/2 > k > -n(n+1)/2 with odd n.

A340220 Constant whose decimal expansion is the concatenation of the largest n-digit prime A003618(n), for n = 1, 2, 3, ...

Original entry on oeis.org

7, 9, 7, 9, 9, 7, 9, 9, 7, 3, 9, 9, 9, 9, 1, 9, 9, 9, 9, 8, 3, 9, 9, 9, 9, 9, 9, 1, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 3, 7, 9, 9, 9, 9, 9, 9, 9, 9, 6, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 1
Offset: 0

Views

Author

M. F. Hasler, Jan 01 2021

Keywords

Comments

This is the limit of the terms of A338968, either digit-wise, or as a constant, up to powers of 10.

Examples

			The smallest prime with 1, 2, 3, 4, ... digits is, respectively, 7, 97, 997, 9973, 99991, 999983, ...
Here we list the sequence of digits of these numbers: 7; 9, 7; 9, 9, 7; 9, 9, 7, 3; ...
This can be considered, as for the Champernowne and Copeland-Erdős constants, as the decimal expansion of a real constant 0.797997997399991...

Crossrefs

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

Programs

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

Formula

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

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.
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.