A283486 -id:A283486 - cp's OEIS frontend

A283495 Smallest k such that there is a number whose divisors sum to k*n.

1, 2, 1, 1, 3, 1, 1, 1, 2, 2, 4, 1, 1, 2, 1, 2, 4, 1, 2, 1, 2, 2, 6, 1, 6, 3, 2, 1, 6, 2, 1, 1, 4, 2, 4, 1, 2, 1, 1, 1, 4, 1, 6, 1, 2, 3, 6, 1, 2, 3, 2, 2, 4, 1, 2, 1, 1, 3, 6, 1, 3, 2, 1, 2, 3, 2, 6, 1, 2, 2, 4, 1, 7, 1, 2, 2, 4, 1, 2, 1, 2, 2, 4, 1, 3, 3, 2, 2, 23, 1, 1, 4, 1, 3, 6, 1

Offset: 1

Juri-Stepan Gerasimov, Mar 08 2017

nonn

Smallest k >=1 such that (number of numbers whose divisor sum to k*n) = m:
m \n|  1  |  2  |  3  |  4  |  5  |  6  |  7  |  8  |  9  | 10 | 11 | 12 |
---------------------------------------------------------------------------
0   |  2  |  1  |  3  |  4  |  1  | 11  |  3  |  2  |  1  |  1 |  1 | 23 |
1   |  1  |  2  |  1  |  1  |  3  |  1  |  1  |  1  |  2  |  2 |  4 |  3 |
2   | 12  |  6  |  4  |  3  | 16  |  2  |  8  |  4  |  2  |  8 | 12 |  1 |
3   | 24  | 12  |  8  |  6  | 12  |  4  |  6  |  3  | 10  |  6 | ...|    |
...

			a(2) = 2 because (number of numbers whose divisor sum to 2*2) = 1.

Cf. A000203, A054973, A283486, A070982.

Cf. A007369 (numbers n such that a(n) > 1).

a(n)=my(k=oo,m,t); while(mCharles R Greathouse IV, Mar 09 2017

Corrected by Charles R Greathouse IV, Mar 09 2017

cp's OEIS Frontend

A283495 Smallest k such that there is a number whose divisors sum to k*n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Extensions