cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A316099 Abundant numbers that differ from the next abundant number by 6.

Original entry on oeis.org

12, 24, 30, 42, 48, 60, 72, 90, 114, 120, 126, 132, 144, 150, 162, 168, 180, 186, 210, 228, 234, 240, 246, 252, 264, 282, 288, 294, 312, 324, 330, 342, 354, 372, 384, 402, 408, 420, 426, 432, 450, 468, 480, 492, 504, 510, 522, 534, 552, 564, 582, 588, 594, 600
Offset: 1

Views

Author

Muniru A Asiru, Jun 25 2018

Keywords

Comments

From Amiram Eldar, Sep 02 2022: (Start)
All the terms are even, since all the multiples of 6 that are larger than 6 are abundant numbers.
The numbers of terms not exceeding 10^k, for k = 2, 3, ..., are 8, 85, 865, 8716, 87668, 875528, 8761027, 87606693, 875947187, ... . Apparently, the asymptotic density of this sequence exists and equals 0.087... . (End)

Examples

			12 is abundant, 13, 14, 15, 16 and 17 are deficient, 18 is abundant.
24 is abundant, 25, 26, 27, 28 and 29 are deficient, 30 is abundant.

Links

Crossrefs

Subsequence of A005101.
Cf. A316097, A343302.
Cf. A231626 (which has many common terms when 1 is subtracted).

Programs

  • GAP
    A:=Filtered([1..800],n->Sigma(n)>2*n);;  a:=List(Filtered([1..Length(A)-1],i->A[i+1]-A[i]=6),j->A[j]);
  • Maple
    with(numtheory):  A:=select(n->sigma(n)>2*n,[$1..800]): a:=seq(A[i],i in select(n->A[n+1]-A[n]=6,[$1..nops(A)-1]));
  • Mathematica
    q[n_] := DivisorSigma[1, n] > 2 n; Select[Range[600], q[#] && SelectFirst[# + Range[6], q] == # + 6 &] (* Giovanni Resta, Jul 01 2018 *)
  • PARI
    list(lim) = {my(k = 1, k2); for(k2 = 2, lim, if(sigma(k2, -1) > 2, if(k2 == k1 + 6, print1(k1, ", ")); k1 = k2));} \\ Amiram Eldar, Mar 01 2025

Formula

a(n) = A005101(A316097(n)). - Amiram Eldar, Mar 01 2025

A316095 Numbers m such that A(m+1) = A(m) + 3, where A() = A005101() are the abundant numbers.

Original entry on oeis.org

231, 232, 385, 386, 544, 545, 699, 700, 858, 859, 1014, 1015, 1172, 1173, 1326, 1327, 1431, 1488, 1600, 1601, 1645, 1646, 1699, 1700, 1806, 1807, 1850, 1959, 1960, 2015, 2016, 2093, 2094, 2119, 2120, 2221, 2222, 2272, 2273, 2378, 2379, 2433, 2434, 2583, 2584
Offset: 1

Views

Author

Muniru A Asiru, Jun 25 2018

Keywords

Links

Crossrefs

A228382 is the main sequence for this entry.
Numbers m such that A(m+1) = A(m) + k, where A() = A005101() are the abundant numbers: A169822 (k=1), A303741 (k=2), this sequence (k=3), A316096 (k=4), A316097 (k=6).
Cf. A005101, A091194.

Programs

  • GAP
    A:=Filtered([1..20000],n->Sigma(n)>2*n);;  a:=Filtered([1..Length(A)-1],i->A[i+1]=A[i]+3);
  • Maple
    with(numtheory): A:=select(n->sigma(n)>2*n,[$1..20000]):  a:=select(j->A[j+1]=A[j]+3,[$1..nops(A)-1]);
  • Mathematica
    Position[Map[{#1, #2 - 3} & @@ # &, Partition[Select[Range[12000], DivisorSigma[1, #] > 2 # &], 2, 1]], ?(SameQ @@ # &)][[All, 1]] (* _Michael De Vlieger, Jun 29 2018 *)
  • PARI
    lista(nn) = {my(va = select(x->(sigma(x) > 2*x), [1..nn]), dva = vector(#va-1, k, va[k+1] - va[k])); select(x->(x==3), dva, 1);} \\ Michel Marcus, Jul 03 2018

Formula

Sequence is { m | A005101(m+1) = A005101(m) + 3 }.
Sequence is { m | A125115(m) = 3 }.
a(n) = A091194(A228382(n)). - Amiram Eldar, Mar 01 2025

A316096 Numbers m such that A(m+1) = A(m) + 4, where A() = A005101() are the abundant numbers.

Original entry on oeis.org

3, 6, 11, 13, 17, 18, 21, 24, 25, 32, 35, 40, 43, 46, 47, 50, 53, 60, 63, 64, 69, 72, 75, 78, 85, 88, 91, 94, 95, 100, 105, 106, 109, 112, 115, 117, 121, 124, 127, 130, 132, 136, 139, 140, 147, 148, 151, 154, 157, 159, 165, 168, 171, 176, 177, 180, 181, 184
Offset: 1

Views

Author

Muniru A Asiru, Jun 25 2018

Keywords

Links

Crossrefs

A316098 is the main sequence for this entry.
Numbers m such that A(m+1) = A(m) + k, where A() = A005101() are the abundant numbers: A169822 (k=1), A303741 (k=2), A316095 (k=3), this sequence (k=4), A316097 (k=6).
Cf. A005101, A091194.

Programs

  • GAP
    A:=Filtered([1..1000],n->Sigma(n)>2*n);;  a:=Filtered([1..Length(A)-1],i->A[i+1]=A[i]+4);
  • Maple
    with(numtheory): A:=select(n->sigma(n)>2*n,[$1..1000]):  a:=select(j->A[j+1]=A[j]+4,[$1..nops(A)-1]);
  • Mathematica
    Position[Map[{#1, #2 - 4} & @@ # &, Partition[Select[Range[10^3], DivisorSigma[1, #] > 2 # &], 2, 1]], ?(SameQ @@ # &)][[All, 1]] (* _Michael De Vlieger, Jun 29 2018 *)
  • PARI
    list(lim) = {my(k = 1, k2, m = 0); for(k2 = 2, lim, if(sigma(k2, -1) > 2, if(k2 == k1 + 4, print1(m, ", ")); m++; k1 = k2));} \\ Amiram Eldar, Mar 01 2025

Formula

Sequence is { m | A005101(m+1) = A005101(m) + 4 }.
Sequence is { m | A125115(m) = 4 }.
a(n) = A091194(A316098(n)). - Amiram Eldar, Mar 01 2025
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.