The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A350174

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

A350174

For k = 0, 1, 2, 3, ... write k prime(k+1) times.
(history; published version)

#17 by Michael De Vlieger at Fri May 26 15:27:33 EDT 2023

STATUS

proposed

approved

#16 by Peter Munn at Fri May 26 13:37:33 EDT 2023

STATUS

editing

proposed

#15 by Peter Munn at Fri May 26 13:36:55 EDT 2023

FORMULA

a(n) = A083375(n+1) + - 1. - Peter Munn, May 26 2023

STATUS

proposed

editing

#14 by Peter Munn at Fri May 26 13:17:00 EDT 2023

STATUS

editing

proposed

#13 by Peter Munn at Fri May 26 13:15:35 EDT 2023

FORMULA

a(n) = A083375(n+1) + 1. - Peter Munn, May 26 2023

CROSSREFS

Essentially the same as A083375.

KEYWORD

nonn,easy

STATUS

approved

editing

#12 by Michael De Vlieger at Tue Apr 19 11:39:38 EDT 2022

STATUS

proposed

approved

#11 by Kevin Ryde at Tue Apr 19 04:17:26 EDT 2022

STATUS

editing

proposed

#10 by Kevin Ryde at Tue Apr 19 04:15:35 EDT 2022

COMMENTS

a(n) = k is the largest k with sum of primes A007504(k) <= n. - Kevin Ryde, Apr 19 2022

CROSSREFS

Cf. A000040, A007504.

STATUS

approved

editing

#9 by Michel Marcus at Sun Dec 19 02:12:13 EST 2021

STATUS

reviewed

approved

#8 by Joerg Arndt at Sun Dec 19 01:43:00 EST 2021

STATUS

proposed

reviewed