id:A124332 - OEIS Search Results

Search: id:A124332

Displaying 1-1 of 1 results found.

page 1

a(n) = ((n mod d(n)) +1)th divisor of n, where d(n) is number of positive divisors of n.

+0
3

1, 1, 3, 2, 5, 3, 7, 1, 1, 5, 11, 1, 13, 7, 15, 2, 17, 1, 19, 4, 3, 11, 23, 1, 5, 13, 27, 14, 29, 15, 31, 4, 3, 17, 35, 1, 37, 19, 39, 1, 41, 3, 43, 4, 9, 23, 47, 24, 7, 5, 51, 26, 53, 27, 55, 1, 3, 29, 59, 1, 61, 31, 9, 2, 5, 3, 67, 4, 3, 35, 71, 1, 73, 37, 15, 38, 7, 39, 79, 1, 3, 41, 83, 1 (list; graph; listen)

	OFFSET	`1,3`
	MATHEMATICA	`f[n_] := Block[{d = Divisors[n]}, d[[Mod[n, Length[d]] + 1]]]; Table[f[n], {n, 90}] (Chandler)`
	CROSSREFS	`Cf. A000005, A122377, A124333.` `Adjacent sequences: A124329 A124330 A124331 this_sequence A124333 A124334 A124335` `Sequence in context: A057958 A057953 A129231 this_sequence A076605 A030640 A026741`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006`

page 1

Search completed in 0.002 seconds

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.

AT&T Labs Research