id:A116548 - OEIS Search Results

Search: id:A116548

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest divisor d of n that occurs earlier in the sequence fewer than a(d) times.

+0
3

1, 2, 3, 2, 5, 3, 7, 4, 3, 5, 11, 4, 13, 7, 5, 8, 17, 6, 19, 5, 7, 11, 23, 6, 5, 13, 9, 7, 29, 6, 31, 8, 11, 17, 7, 9, 37, 19, 13, 8, 41, 7, 43, 11, 9, 23, 47, 8, 7, 10, 17, 13, 53, 18, 11, 14, 19, 29, 59, 10, 61, 31, 21, 16, 13, 11, 67, 17, 23, 10, 71, 12, 73, 37, 15, 19, 11, 13, 79, 10 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`When n is prime, no smaller divisor is available, so a(n) = n. It can be shown than a(n) < n if n is composite. Similar to Golomb's sequence (A001462), but with the added condition that a(n) divides n.`
	CROSSREFS	`Cf. A095163, A001462.` `Sequence in context: A072505 A095163 A033677 this_sequence A117818 A073890 A079311` `Adjacent sequences: A116545 A116546 A116547 this_sequence A116549 A116550 A116551`
	KEYWORD	`nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 16 2006`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research