id:A050767 - OEIS Search Results

Search: id:A050767

Displaying 1-1 of 1 results found.

page 1

Let f(m) = smallest composite number which takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.

+0
2

11, 23, 83, 149, 167, 251, 269, 881, 2039, 5021, 9311, 35111, 82219, 89809, 181421, 289099, 420899, 885839, 996157, 1963799, 2554439, 2843903, 3269039, 3632701, 4648519, 6448103, 9748579, 35200439, 71927183, 82216501, 283709077 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`C. Rivera, See also related puzzle`
	EXAMPLE	`E.g. 23 is included as it is both g(2) (with f(2)=8) and g(3) (with f(3)=4): '8' + (2+2+2) => 14 + (2+7) => 23; '4' + (2+2) => 8 + (2+2+2) => 14 + (2+7) => 23.`
	CROSSREFS	`Cf. A050703, A050710 (for f(n)).` `Sequence in context: A104066 A060160 A158021 this_sequence A145918 A077707 A081981` `Adjacent sequences: A050764 A050765 A050766 this_sequence A050768 A050769 A050770`
	KEYWORD	`nonn,nice`
	AUTHOR	`Patrick De Geest (pdg(AT)worldofnumbers.com), Sep 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.

AT&T Labs Research