A135245 -id:A135245 - cp's OEIS frontend

A152454 Irregular triangle in which row n lists the numbers whose proper divisors sum to n.

4, 9, 6, 25, 8, 10, 49, 15, 14, 21, 121, 27, 35, 22, 169, 16, 33, 12, 26, 39, 55, 289, 65, 77, 34, 361, 18, 51, 91, 20, 38, 57, 85, 529, 95, 119, 143, 46, 69, 133, 28, 115, 187, 841, 32, 125, 161, 209, 221, 58, 961, 45, 87, 247, 62, 93, 145, 253, 24, 155, 203, 299, 323, 1369

Offset: 2

T. D. Noe, Dec 05 2008

In an aliquot sequence, all numbers in row n can be predecessors of n. This sequence is a permutation of the composite numbers; number k appears in row A001065(k). We start with n=2 because every prime would be in row 1. Note that row 2 is empty -- as are all the rows listed in A005114. Row n contains A048138(n) numbers. When n is prime, the largest number in row n+1 is n^2. When n>7 is odd, the largest number in row n is less than ((n-1)/2)^2 and (if a strong form of the Goldbach conjecture is true) has the form pq, with primes p

In row n, the first term is A070015(n), and the last term is A135244(n). - Michel Marcus, Nov 11 2014

The first row with several terms is row(6), where the difference between extreme terms is 25-6=19. The next row with a smaller difference is row(13) with a difference 35-27=8. And the next one is row(454) with a difference 602-596=6. Is there a next row with a smaller difference? - Michel Marcus, Nov 11 2014

			Irregular triangle starts:
  ; (empty row at n=2)
  4;
  9;
  ; (empty row at n=5)
  6, 25;
  8;
  10, 49;
  15;
  14;
  21;
  121;
  27, 35;
  22, 169;
  16, 33;
  12, 26;
  39, 55;
  289;
  ...

T. D. Noe, Rows n=2..1000 of triangle, flattened
Michel Marcus, Rows n=2..1000 of triangle, not flattened

Cf. A001065, A005114, A048138.

Cf. A070015, A135244, A135245.

N:= 100: # for rows 2 to N, flattened
for s from 2 to N do B[s]:= NULL od:
for k from 1 to N^2 do
  if not isprime(k) then
    s:= numtheory:-sigma(k)-k;
    if s <= N then
       B[s]:= B[s],k;
    fi
  fi
od:
seq(B[s],s=2..N); # Robert Israel, Nov 11 2014

nn=100; s=Table[{},{nn}]; Do[k=DivisorSigma[1,n]-n; If[1

row(n) = select(x->(sigma(x)-x)==n, [1..n^2]); \\ Michel Marcus, Feb 25 2025

A135244 Largest m such that the sum of the aliquot parts of m (A001065) equals n, or 0 if no such number exists.

Original entry on oeis.org

0, 4, 9, 0, 25, 8, 49, 15, 14, 21, 121, 35, 169, 33, 26, 55, 289, 77, 361, 91, 38, 85, 529, 143, 46, 133, 28, 187, 841, 221, 961, 247, 62, 253, 24, 323, 1369, 217, 81, 391, 1681, 437, 1849, 403, 86, 493, 2209, 551, 94, 589, 0, 667, 2809, 713, 106, 703, 68, 697, 3481

Offset: 2

Ophir Spector (ospectoro(AT)yahoo.com), Nov 25 2007

nonn

Previous name: Aliquot predecessors with the largest values.
Find each node's predecessors in aliquot sequences and choose the largest predecessor.
Climb the aliquot trees on shortest paths (see A135245 = Climb the aliquot trees on thickest branches).
The sequence starts at offset 2, since all primes satisfy sigma(n)-n = 1. - Michel Marcus, Nov 11 2014

			a(25) = 143 since 25 has 3 predecessors (95,119,143), 143 being the largest.
a(5) = 0 since it has no predecessors (see Untouchables - A005114).

Amiram Eldar, Table of n, a(n) for n = 2..10000 (terms 2..150 from Ophir Spector)
Wolfgang Creyaufmueller, Aliquot sequences.
J. O. M. Pedersen, Tables of Aliquot Cycles. [Broken link]
J. O. M. Pedersen, Tables of Aliquot Cycles. [Via Internet Archive Wayback-Machine]
J. O. M. Pedersen, Tables of Aliquot Cycles. [Cached copy, pdf file only]
Eric Weisstein's World of Mathematics, Aliquot sequence.

Cf. A001065, A005114, A125601, A135245, A057709, A057710, A063769, A080907, A121507, A037020, A126016.

seq[max_] := Module[{s = Table[0, {n, 1, max}], i}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]] = Max[s[[i]], n]], {n, 2, (max - 1)^2}]; Rest @ s]; seq[50]

lista(nn) = {for (n=2, nn, k = (n-1)^2; while(k && (sigma(k)-k != n), k--); print1(k, ", "););} \\ Michel Marcus, Nov 11 2014

a(1)=0 removed and offset set to 2 by Michel Marcus, Nov 11 2014

New name from Michel Marcus, Oct 31 2023

Showing 1-2 of 2 results.

cp's OEIS Frontend

A152454 Irregular triangle in which row n lists the numbers whose proper divisors sum to n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI