id:A029911 - OEIS Search Results

Search: id:A029911

Displaying 1-1 of 1 results found.

page 1

Start with n; if prime, skip; repeatedly sum prime factors (counted with multiplicity) and add 1, until reach 1, 6 or a prime.

+0
1

1, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 11, 7, 7, 11, 7, 7, 7, 11, 11, 7, 7, 13, 11, 7, 17, 7, 13, 7, 7, 7, 7, 7, 13, 11, 7, 7, 17, 7, 23, 11, 13, 7, 7, 13, 19, 17, 7, 7, 7, 13, 7, 7, 7, 19, 19, 7, 13, 7, 7, 23, 7, 7, 7, 7, 11, 7, 13, 13, 11, 7, 17, 7, 7, 23, 7, 7, 7, 7, 19, 41, 7 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`20 -> 2+2+5+1 = 10 -> 2+5+1 = 8 -> 2+2+2+1 = 7.`
	CROSSREFS	`Cf. A029910.` `Sequence in context: A021642 A095942 A139395 this_sequence A002141 A114547 A030541` `Adjacent sequences: A029908 A029909 A029910 this_sequence A029912 A029913 A029914`
	KEYWORD	`nonn`
	AUTHOR	`Dann Toliver (fsdrt(AT)hotmail.com)`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research