The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126889 a(n) = the number of divisors of A126888(n). 4

%I #10 Oct 11 2017 21:57:53

%S 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,

%T 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,

%U 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

%N a(n) = the number of divisors of A126888(n).

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

%H Michael De Vlieger, <a href="/A126889/b126889.txt">Table of n, a(n) for n = 1..10000</a>

%t 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 *)

%Y Cf. A126888.

%K nonn

%O 1,2

%A _Leroy Quet_, Dec 30 2006

%E Extended by _Ray Chandler_, Jan 04 2007

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

Last modified April 12 16:56 EDT 2024. Contains 371635 sequences. (Running on oeis4.)