A146071 - OEIS

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

A146071

Consider A145834 as the first step of the sieving (subtracting the sum of its prime factors with repetition from the composite numbers). This sequence is the result of the subsequent application of above described sieving - thus all terms of this sequence arise as prime numbers.

0, 1, 2, 3, 3, 5, 5, 7, 2, 3, 11, 11, 3, 7, 7, 11, 3, 17, 11, 3, 19, 7, 23, 11, 17, 23, 29, 11, 29, 7, 11, 37, 23, 17, 31, 23, 43, 23, 43, 23, 3, 37, 29, 17, 23, 47, 17, 47, 43, 43, 37, 23, 29, 53, 59, 37, 67, 43, 23, 43, 17, 41, 23, 71, 59, 71, 47, 59, 7, 71, 83, 23, 23, 41, 67, 17, 59

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

Florentin Smarandache (in a Sunday, Nov 02 2008 email exchange) asks: how many times does each prime (> 3) appear in this sequence? This question can also be asked about A029909. - Alexander R. Povolotsky, Nov 07 2008

LINKS

Table of n, a(n) for n=1..77.

PROG

(PARI) A146071(n)=n=A002808(n); while( n>1 & !isprime(n), n=A075255(n)); n \\ M. F. Hasler, Nov 02 2008

CROSSREFS

Cf. A145834, A001414, A002808, A075255.

Sequence in context: A161172 A093505 A238527 * A167411 A340195 A340192

Adjacent sequences: A146068 A146069 A146070 * A146072 A146073 A146074

KEYWORD

nonn

AUTHOR

Alexander R. Povolotsky, Oct 26 2008

EXTENSIONS

More terms from M. F. Hasler, Nov 02 2008

STATUS

approved