id:A126889 - OEIS Search Results

Search: id:A126889

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`1,2`
	COMMENT	`Is a(n) well-defined? Does every positive integer n equal floor(m/d(m)) for some m?`
	MATHEMATICA	`f[n_] := Block[{k = 1, d}, While[d = Length[Divisors[k]]; Floor[k/d] != n, k++ ]; d]; Table[f[n], {n, 105}] (Chandler)`
	CROSSREFS	`Cf. A126888.` `Sequence in context: A053214 A077198 A046110 this_sequence A134339 A110141 A129750` `Adjacent sequences: A126886 A126887 A126888 this_sequence A126890 A126891 A126892`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Dec 30 2006`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 04 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research