login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126889 a(n) = the number of divisors of A126888(n). 4
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 (list; graph; refs; listen; history; text; internal format)
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: A077198 A046110 A296091 * A205030 A278250 A134339

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 08:57 EST 2019. Contains 320309 sequences. (Running on oeis4.)