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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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
Essentially the same as A083375.
Sequence in context: A263846 A350088 A178786 * A000196 A111850 A343265
KEYWORD
nonn,easy
AUTHOR
Michel Marcus, Dec 18 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)