login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A131903
Integers x such that d(k)=d(x) for some 0<k<x, where d=A000005 is the number of divisors.
2
3, 5, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78
OFFSET
1,1
COMMENTS
Complement of A007416. - T. D. Noe, Jul 26 2007
FORMULA
a(n) = n-th element of the set {x>0 : there exists a k with 0<k<x and d(k)=d(x)}, where d=A000005 is the number of divisors.
EXAMPLE
This sequence contains 8 because 8 has |{1,2,4,8}|=4 divisors and 6<8 has |{1,2,3,6}|=4 divisors.
MATHEMATICA
Clear[tmp]; Function[n, If[Head[ #1] === tmp, #1 = n; Unevaluated[Sequence[]], n] & [tmp[DivisorSigma[0, n]]]] /@ Range[64]
PROG
(PARI) isok(n) = {my(nd = numdiv(n)); for (k=1, n-1, if (numdiv(k) == nd, return (1)); ); }
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Peter Pein (petsie(AT)dordos.net), Jul 26 2007
EXTENSIONS
a(54)-a(67) from Michel Marcus, Apr 03 2015
Edited by Danny Rorabaugh, Apr 03 2015
STATUS
approved