|
|
A350174
|
|
For k = 0, 1, 2, 3, ... write k prime(k+1) times.
|
|
1
|
|
|
0, 0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
a(n) = k is the largest k with sum of primes A007504(k) <= n. - Kevin Ryde, Apr 19 2022
|
|
REFERENCES
|
J.-P. Delahaye, Des suites fractales d’entiers, Pour la Science, No. 531 January 2022. Sequence g) p. 82.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
a:=[];
for n from 0 to 10 do a:=[op(a), seq(n, i=1..ithprime(n+1))]; od:
|
|
PROG
|
(Python)
from itertools import count, islice, chain
from sympy import prime
def A350174gen(): return chain.from_iterable([k]*prime(k+1) for k in count(0))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|