id:A067566 - OEIS Search Results

Search: id:A067566

Displaying 1-1 of 1 results found.

page 1

Smallest k such that k=n*A001414(k) (or 0 if no such k exists), where A001414(k) is the integer log of k, i.e. Sum p_i*e_i if the prime factorization of k is Product p_i^e_i.

+0
1

2, 16, 27, 0, 60, 72, 105, 0, 0, 150, 220, 180, 0, 308, 240, 256, 476, 288, 627, 440, 378, 0, 805, 528, 450, 624, 594, 560, 1160, 540, 1581, 576, 0, 1122, 0, 648, 1776, 1748, 0, 800, 3526, 0, 2322, 1056, 900, 0, 3055, 960, 0, 0, 1530, 1456, 4028 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(3)=27 since 27=3^3 and 27=3(33), but not 30 despite 30=2^13^15^1 and 30=3(21+31+51) because 27 is less than 30.`
	CROSSREFS	`Cf. A001414, A056240.` `Sequence in context: A118954 A119599 A019317 this_sequence A067555 A108705 A113933` `Adjacent sequences: A067563 A067564 A067565 this_sequence A067567 A067568 A067569`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Jan 30 2002`
	EXTENSIONS	`Edited by Henry Bottomley (se16(AT)btinternet.com), Jul 07 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research