A126889 a(n) = the number of divisors of A126888(n).

1, 2, 2, 6, 2, 2, 6, 2, 2, 6, 2, 4, 4, 2, 2, 3, 4, 2, 4, 2, 2, 4, 2, 6, 6, 2, 4, 4, 2, 2, 4, 4, 2, 6, 2, 2, 8, 4, 2, 3, 2, 16, 6, 2, 4, 4, 6, 2, 8, 2, 2, 4, 2, 2, 4, 2, 8, 4, 4, 6, 4, 4, 2, 4, 2, 4, 6, 2, 2, 6, 4, 4, 4, 2, 2, 4, 4, 2, 4, 4, 2, 4, 2, 4, 4, 2, 6, 4, 2, 2, 4, 4, 11, 4, 2, 2, 4, 2, 2, 4, 4, 4, 4, 4, 2

Offset

1,2

Comments

Is a(n) well-defined? Does every positive integer n equal floor(m/d(m)) for some m?

Links

Michael De Vlieger, Table of n, a(n) for n = 1..10000

Mathematica

f[n_] := Block[{k = 1, d}, While[d = Length[Divisors[k]]; Floor[k/d] != n, k++ ]; d]; Table[f[n], {n, 105}] (* Ray Chandler, Jan 04 2007 *)

Crossrefs

Cf. A126888.

Sequence in context: A046110 A296091 A352892 * A205030 A278250 A357441

Adjacent sequences: A126886 A126887 A126888 * A126890 A126891 A126892

Keyword

nonn

Author

Leroy Quet, Dec 30 2006

Extensions

Extended by Ray Chandler, Jan 04 2007

Status

approved