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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036470 a(n) is the number of distinct possible values of d(k), the number of divisors of k, among numbers k whose binary order (A029837) does not exceed n. 4
 1, 2, 3, 4, 6, 7, 11, 12, 16, 17, 23, 26, 31, 37, 43, 48, 58, 64, 74, 82, 94, 106, 122, 133, 146, 165, 183, 202, 224, 244, 267, 294, 325, 355, 389, 416, 453, 500, 541, 584, 636, 680, 737, 795, 859, 922, 995, 1068, 1149, 1233, 1324, 1412, 1523, 1616, 1731, 1845 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS David A. Corneth, Table of n, a(n) for n = 0..63 EXAMPLE If 1 <= k <= 128, i.e., the binary order of k is g(k) <= 7, then d(k) takes 12 values {1,2,3,4,5,6,7,8,9,10,12,16}; thus a(7) = 12. The maximal value (16) appears as a(7) in A036451. CROSSREFS Cf. A000005, A005179, A029837, A036471, A036493. Sequence in context: A088412 A352192 A074177 * A111243 A344635 A203898 Adjacent sequences: A036467 A036468 A036469 * A036471 A036472 A036473 KEYWORD nonn AUTHOR EXTENSIONS a(20)-a(21) corrected by David A. Corneth, May 12 2018 STATUS approved

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 December 7 15:01 EST 2022. Contains 358667 sequences. (Running on oeis4.)