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.
FORMULA
a(n) = A083375(n+1) - 1. - Peter Munn, May 26 2023
MAPLE
a:=[];
for n from 0 to 10 do a:=[op(a), seq(n, i=1..ithprime(n+1))]; od:
a; # N. J. A. Sloane, Dec 18 2021
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))
A350174_list = list(islice(A350174gen(), 50)) # Chai Wah Wu, Dec 19 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michel Marcus, Dec 18 2021
STATUS
approved