STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A160691
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
a(n) = the number of divisors of A160689(n) = the number of divisors of A160690(n).
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
COMMENTS
a(n)=10 for n=271532 and n=424519 (up to 5*10^5). - Michel Marcus, Sep 05 2017
LINKS
Michel Marcus, <a href="/A160691/b160691.txt">Table of n, a(n) for n = 1..5000</a>
COMMENTS
Also n=2 is the only number integer (less than 200000) such that a(n) = a(n+1) = a(n+2) = 2.
PROG
(PARI) lista(nn) = {k = 1; print1(numdiv(k), ", "); last = k; for (n=2, nn, k = last+1; while(numdiv(k) != numdiv(k - last), k++); print1(numdiv(k), ", "); s += k; last = k; ); } \\ Michel Marcus, Sep 05 2017
COMMENTS
For one number n, A160691a(n)=1.
For 13 numbers n, A160691a(n)=12 (see the sequence A158963).
For 4785 numbers n, A160691a(n)=6.
For 6706 numbers n, A160691a(n)=8.
For 26790 numbers n, A160691a(n)=2.
For 161705 numbers n, A160691a(n)=4.
Also n=2 is the only number n integer (less than 200000) such that a(n) = a(n+1) = a(n+2) = 2.
and And for the 53 consecutive numbers 64833, 64834, ..., 64885 we have a(n)=4. (End)
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
COMMENTS
Contribution from _From _Farideh Firoozbakht_, May 28 2009: (Start)
STATUS
proposed
editing