The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A068670

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A068670

Number of digits in the concatenation of first n primes.
(history; published version)

#53 by Alois P. Heinz at Fri Feb 03 14:58:30 EST 2023

STATUS

proposed

approved

#52 by Michael S. Branicky at Fri Feb 03 14:55:59 EST 2023

STATUS

editing

proposed

#51 by Michael S. Branicky at Fri Feb 03 14:55:57 EST 2023

PROG

(Python)

from sympy import sieve

from itertools import accumulate, chain

def f(_, n): return _ + len(str(n))

def agen(): yield from accumulate(chain((0, ), (p for p in sieve)), f)

print(list(islice(agen(), 62))) # Michael S. Branicky, Feb 03 2023

STATUS

approved

editing

#50 by Charles R Greathouse IV at Thu Sep 08 08:45:05 EDT 2022

PROG

(MAGMAMagma) a068670:=func< n | n + &+[ Floor(Log(10, NthPrime(k))): k in [1..n] ] >; [ a068670(n): n in [1..70] ];

Discussion

Thu Sep 08

08:45

OEIS Server: https://oeis.org/edit/global/2944

#49 by OEIS Server at Sat Nov 02 17:34:04 EDT 2019

LINKS

Charles R Greathouse IV, <a href="/A068670/b068670_1.txt">Table of n, a(n) for n = 0..10000</a>. (Initial 0 added by M. F. Hasler, Nov 02 2019.)

#48 by M. F. Hasler at Sat Nov 02 17:34:04 EDT 2019

STATUS

editing

approved

Discussion

Sat Nov 02

17:34

OEIS Server: Installed new b-file as b068670.txt.  Old b-file is now b068670_1.txt.

#47 by M. F. Hasler at Sat Nov 02 17:33:52 EDT 2019

LINKS

Charles R Greathouse IV, <a href="/A068670/b068670_1.txt">Table of n, a(n) for n = 10..10000</a>. (Initial 0 added by _M. F. Hasler_, Nov 02 2019.)

STATUS

approved

editing

#46 by N. J. A. Sloane at Fri Oct 25 12:36:57 EDT 2019

STATUS

proposed

approved

#45 by M. F. Hasler at Thu Oct 24 17:43:24 EDT 2019

STATUS

editing

proposed

#44 by M. F. Hasler at Thu Oct 24 17:43:17 EDT 2019

PROG

(PARI) A68670=[1]List(0); aA068670(n)=if(n>#A68670, my{for(N=#A68670, S=A68670[N]); n, listput(A68670=concat(, A68670, vector(n-[N, k, S] += A097944(N+=1))); S, n, A68670[n+1], 0) } \\ M. F. Hasler, Oct 24 2019

STATUS

proposed

editing