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”).

A111172
Position of first occurrence of n in A039819.
1
1, 2, 4, 3, 63, 5, 6115, 7, 8, 13, 761401060, 11
OFFSET
1,2
COMMENTS
The sequence is well-defined because every integer occurs in the sequence A039819 at least once (see S. Colton, Theorem 5). a(11) is probably between 10^8 and 10^9, a(12)=11.
a(14) = 47. a(15) = 170. a(16) = 42. - Donovan Johnson, Apr 04 2011
LINKS
S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999, #2.
EXAMPLE
a(6)=5 because the first 6 occurs in A039819 at position 5.
MATHEMATICA
c = 0; t = Table[0, {100}]; Do[d = DivisorSigma[0, n]; If[ Mod[n, d]==0, c++; If[d < 101 && t[[d]] == 0, t[[d]] = c; Print[{d, c, n}]]], {n, 10^9}]; t (* Robert G. Wilson v *)
CROSSREFS
Sequence in context: A163089 A370635 A258371 * A173556 A247554 A198786
KEYWORD
nonn,more
AUTHOR
Franz Vrabec, Oct 21 2005
EXTENSIONS
a(11) from Donovan Johnson, Apr 04 2011
STATUS
approved