id:A072865 - OEIS Search Results

Search: id:A072865

Displaying 1-1 of 1 results found.

page 1

Smallest k > 1 dividing tau(k*n) (cf. A000005).

+0
1

2, 4, 2, 2, 2, 2, 2, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Sequence contains the values 2,3,4,5,6,7,8,9,10,11,12. The smallest x such that a(x)=12 is x = 32768 = 2^15.`
	CROSSREFS	`Adjacent sequences: A072862 A072863 A072864 this_sequence A072866 A072867 A072868` `Sequence in context: A037178 A113973 A123330 this_sequence A013604 A021809 A117007`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 27 2002`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research