id:A029910 - OEIS Search Results

Search: id:A029910

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 2, 3, 5, 5, 6, 7, 7, 7, 7, 11, 7, 13, 7, 7, 7, 17, 7, 19, 7, 11, 7, 23, 7, 11, 7, 7, 7, 29, 11, 31, 11, 7, 7, 13, 11, 37, 7, 17, 7, 41, 13, 43, 7, 7, 7, 47, 7, 7, 13, 11, 7, 53, 7, 17, 7, 23, 11, 59, 13, 61, 7, 7, 13, 19, 17, 67, 7, 7, 7, 71, 13, 73, 7, 7, 7, 19, 19, 79, 7 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`20 -> 2+2+5+1 = 10 -> 2+5+1 = 8 -> 2+2+2+1 = 7 so a(20)=7.`
	CROSSREFS	`Sequence in context: A133304 A003660 A111164 this_sequence A063677 A078903 A079228` `Adjacent sequences: A029907 A029908 A029909 this_sequence A029911 A029912 A029913`
	KEYWORD	`nonn`
	AUTHOR	`Dann Toliver (fsdrt(AT)hotmail.com)`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research