login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029909 Starting with n (but omitting the primes), repeatedly sum prime factors (counted with multiplicity) until reaching a limit. 3
0, 4, 5, 5, 5, 7, 7, 5, 5, 5, 5, 5, 7, 13, 5, 7, 5, 5, 11, 7, 7, 5, 19, 7, 7, 7, 5, 11, 7, 5, 11, 7, 11, 5, 7, 5, 17, 11, 5, 13, 13, 31, 7, 5, 13, 7, 5, 5, 7, 5, 5, 7, 5, 13, 23, 5, 5, 13, 7, 43, 5, 13, 11, 7, 17, 13, 5, 5, 19, 5, 5, 13, 5, 17, 5, 13, 19, 5, 5, 13, 5, 11, 5, 5, 11, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Is this sequence generating ALL prime numbers (greater than 3) ? Also how many times each prime (greater than 3)is generated in this sequence? [From Alexander R. Povolotsky, Nov 05 2008]

LINKS

Paolo P. Lava, Table of n, a(n) for n = 1..10000

EXAMPLE

20 -> 2+2+5 = 9 -> 3+3 = 6 -> 2+3 = 5.

CROSSREFS

Cf. A029908.

Sequence in context: A264936 A103671 A144192 * A141276 A088202 A238187

Adjacent sequences:  A029906 A029907 A029908 * A029910 A029911 A029912

KEYWORD

nonn

AUTHOR

Dann Toliver

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified June 22 08:08 EDT 2017. Contains 288605 sequences.