The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A267893 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A267893

Numbers with 10 odd divisors.
(history; published version)

#23 by Giovanni Resta at Thu Aug 16 13:31:09 EDT 2018

STATUS

reviewed

approved

#22 by Michael B. Porter at Thu Aug 16 01:18:42 EDT 2018

STATUS

proposed

reviewed

#21 by Julie Jones at Wed Aug 15 01:07:21 EDT 2018

STATUS

editing

proposed

#20 by Julie Jones at Wed Aug 15 01:07:12 EDT 2018

COMMENTS

Numbers that can be formed in exactly 9 ways by summing sequences of 2 or more positive consecutive positive integers. - Julie Jones, Aug 13 2018

STATUS

proposed

editing

#19 by Julie Jones at Tue Aug 14 10:35:57 EDT 2018

STATUS

editing

proposed

#18 by Muniru A Asiru at Tue Aug 14 07:21:23 EDT 2018

LINKS

Muniru A Asiru, <a href="/A267893/b267893.txt">Table of n, a(n) for n = 1..5000</a>

PROG

(GAP) A:=List([1..10000], n->DivisorsInt(n));; B:=List([1..Length(A)], i->Filtered(A[i], IsOddInt));;

a:=Filtered([1..Length(B)], i->Length(B[i])=10); # Muniru A Asiru, Aug 14 2018

#17 by David A. Corneth at Tue Aug 14 04:48:00 EDT 2018

COMMENTS

Numbers that can be formed in exactly 9 ways by summing sequences of 2 or more positive consecutive integers. - Julie Jones, Aug 13 2018

STATUS

proposed

editing

#16 by Julie Jones at Mon Aug 13 20:28:33 EDT 2018

STATUS

editing

proposed

#15 by Julie Jones at Mon Aug 13 20:28:27 EDT 2018

COMMENTS

Numbers that can be formed in exactly 9 ways by summing sequences of 2 or more consecutive integers. - Julie Jones, Aug 13 2018

STATUS

approved

editing

#14 by N. J. A. Sloane at Sat Dec 31 01:44:53 EST 2016

STATUS

proposed

approved