id:A015050 - OEIS Search Results

Search: id:A015050

Displaying 1-1 of 1 results found.

page 1

Let m = A013929(n); then a(n) = smallest k such that m divides k^3.

+0
5

2, 2, 3, 6, 4, 6, 10, 6, 5, 3, 14, 4, 6, 10, 22, 15, 12, 7, 10, 26, 6, 14, 30, 21, 4, 34, 6, 15, 38, 20, 9, 42, 22, 30, 46, 12, 14, 33, 10, 26, 6, 28, 58, 39, 30, 11, 62, 5, 42, 8, 66, 15, 34, 70, 12, 21, 74, 30, 38, 51, 78, 20, 18, 82, 42, 13, 57, 86 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`H. Ibstedt, Surfing on the Ocean of Numbers, Erhus Univ. Press, Vail, 1997.` `M. L. Perez et al., eds., Smarandache Notions Journal`
	CROSSREFS	`a(n) = A019555(A013929(n)). Cf. A015049, A015051.` `Sequence in context: A003506 A047662 A075196 this_sequence A116447 A137757 A132886` `Adjacent sequences: A015047 A015048 A015049 this_sequence A015051 A015052 A015053`
	KEYWORD	`nonn`
	AUTHOR	`R. Muller`
	EXTENSIONS	`Description corrected by Diego Torres (torresvillarroel(AT)hotmail.com), Jun 23 2002`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.

AT&T Labs Research