login

Revision History for A036470

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
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.
(history; published version)
#17 by Susanna Cuyler at Mon May 14 20:25:22 EDT 2018
STATUS

proposed

approved

#16 by Michel Marcus at Sun May 13 02:40:13 EDT 2018
STATUS

editing

proposed

Discussion
Sun May 13
07:20
Jon E. Schoenfield: Thanks!
#15 by Michel Marcus at Sun May 13 02:40:05 EDT 2018
EXTENSIONS

a(20), -a(21) corrected by David A. Corneth, May 12 2018

STATUS

proposed

editing

#14 by David A. Corneth at Sun May 13 02:34:33 EDT 2018
STATUS

editing

proposed

#13 by David A. Corneth at Sun May 13 02:12:04 EDT 2018
LINKS

David A. Corneth, <a href="/A036470/b036470.txt">Table of n, a(n) for n = 0..63</a>

Discussion
Sun May 13
02:34
David A. Corneth: Based on A036451 I'm sure of these values.
#12 by David A. Corneth at Sun May 13 01:56:57 EDT 2018
DATA

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

KEYWORD

nonn,more,changed

#11 by David A. Corneth at Sat May 12 19:21:52 EDT 2018
DATA

1, 2, 3, 4, 6, 7, 11, 12, 16, 17, 23, 26, 31, 37, 43, 48, 58, 64, 74, 82, 95, 10894, 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

EXTENSIONS

a(20), a(21) corrected by David A. Corneth, May 12 2018

STATUS

proposed

editing

Discussion
Sat May 12
19:22
David A. Corneth: Other term in progress
#10 by Jon E. Schoenfield at Sat May 12 18:03:07 EDT 2018
STATUS

editing

proposed

Discussion
Sat May 12
18:04
Jon E. Schoenfield: (One more term beyond a(54)=1731 would be enough to give 260 characters in the Data section and remove keyword more.)
18:53
David A. Corneth: No it doesn't, that's by another script
18:56
David A. Corneth: My method is to find (A005179(n), n) for n = 1..100000, sort by A005179 then use inspection on those values.
19:10
Jon E. Schoenfield: Okay, thanks.
#9 by David A. Corneth at Sat May 12 15:26:13 EDT 2018
CROSSREFS
STATUS

proposed

editing

Discussion
Sat May 12
15:26
David A. Corneth: I'll try hence leave this in editing okay?
15:38
Jon E. Schoenfield: Thanks, David!
17:50
David A. Corneth: Sure! I'd like some feedback if possible; I get different terms; I get (a(20, a(21)) = (94, 106) instead of (95, 108). This script: firstb(n) = my(s = Set()); for(i = 1, 2^n, s = setunion(s, [numdiv(i)])); s, as my check, confirms these result.
17:51
David A. Corneth: *my results.
17:52
David A. Corneth: Now, the values I find are: 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
18:01
Jon E. Schoenfield: For n = 0..23, I get

1, 2, 3, 4, 6, 7, 11, 12, 16, 17, 23, 26, 31, 37, 43, 48, 58, 64, 74, 82, 94, 106, 122, 133
18:03
Jon E. Schoenfield: ... does that script in your 17:50 comment really generate all the terms through a(54)?  :-)
18:52
David A. Corneth: For certainty on more values I'd need to find a method to be able to say: The largest number of divisors a number below k can have is...
#8 by Jon E. Schoenfield at Sat May 12 15:19:03 EDT 2018
STATUS

editing

proposed