A064440 -id:A064440 - cp's OEIS frontend

A356445 a(n) is the number of times that A064440(n) occurs as the sum of proper divisors function (A001065).

2, 3, 5, 7, 13, 17, 19, 23, 31, 41, 59, 61, 67, 79, 83, 97, 101, 109, 113, 127, 131, 139, 149, 151, 193, 199, 223, 227, 229, 277, 283, 317, 397, 433, 521, 541, 577, 607, 677, 743, 757, 811, 863, 881, 911, 971, 1031, 1049, 1063, 1093, 1249, 1319, 1373, 1433, 1489

Offset: 1

Amiram Eldar, Sep 23 2022

nonn

The record values correspond to the terms of A064440.

All the terms are primes by definition.

Amiram Eldar, Table of n, a(n) for n = 1..188

Cf. A001065, A048138, A064440, A238895, A238896.

seq[max_] := Module[{s = Table[0, {n, 1, max}], i, v = {}, m = 0}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]]++], {n, 2, (max - 1)^2}]; Do[If[s[[i]] > m && PrimeQ[s[[i]]], m = s[[i]]; AppendTo[v, s[[i]]]], {i, 1, max}]; v]; seq[2000]

a(n) = A048138(A064440(n)).

A048138 a(n) = number of m such that sum of proper divisors of m (A001065(m)) is n.

Original entry on oeis.org

0, 1, 1, 0, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 3, 2, 2, 1, 3, 1, 2, 1, 2, 1, 5, 2, 3, 1, 3, 1, 4, 1, 1, 3, 4, 2, 5, 2, 3, 2, 3, 1, 6, 2, 4, 0, 3, 2, 6, 1, 5, 1, 3, 1, 6, 2, 3, 3, 6, 1, 6, 1, 2, 1, 5, 1, 8, 3, 4, 3, 5, 1, 7, 1, 6, 1, 4, 1, 8, 1, 5, 0, 5, 2, 9, 2, 4, 1, 4, 0, 9, 1, 3, 2, 6, 1, 8, 2, 7, 4

Offset: 2

Naohiro Nomoto

The offset is 2 since there are infinitely many numbers (all the primes) for which A001065 = 1.
The graph of this sequence, shifted by 1, looks similar to that of A061358, which counts Goldbach partitions of n. - T. D. Noe, Dec 05 2008
For n > 2, a(n) <= A000009(n) as all divisor lists must have distinct values. - Roderick MacPhee, Sep 13 2016
The smallest k > 0 such that there are exactly n numbers whose sum of proper divisors is k is A125601(n). - Bernard Schott, Mar 23 2023

			a(6) = 2 since 6 is the sum of the proper divisors of 6 and 25.

T. D. Noe, Table of n, a(n) for n = 2..10000
Carl Pomerance, The first function and its iterates, pp. 125-138 in Connections in Discrete Mathematics, ed. S. Butler et al., Cambridge, 2018.

Cf. A001065, A064440, A125601, A238895, A238896 (records).

Cf. A005114, A057709, A057710, A160133.

with(numtheory): for n from 2 to 150 do count := 0: for m from 1 to n^2 do if sigma(m) - m = n then count := count+1 fi: od: printf(`%d,`,count): od:

list(n)=my(v=vector(n-1),k); for(m=4,n^2, k=sigma(m)-m; if(k>1 & k<=n, v[k-1]++)); v \\ Charles R Greathouse IV, Apr 21 2011

From Bernard Schott, Mar 23 2023: (Start)
a(n) = 0 iff n is in A005114 (untouchable numbers).
a(n) = 1 iff n is in A057709 ("hermit" numbers).
a(n) = 2 iff n is in A057710.
a(n) > 1 iff n is in A160133. (End)

More terms from James Sellers, Feb 19 2001

cp's OEIS Frontend

A356445 a(n) is the number of times that A064440(n) occurs as the sum of proper divisors function (A001065).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A048138 a(n) = number of m such that sum of proper divisors of m (A001065(m)) is n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

Formula

Extensions