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-1 of 1 results.

A090552 a(1)=1; for n>1, a(n) is the smallest positive integer for which sigma(a(n)) is a multiple of sigma(a(n-1)).

Original entry on oeis.org

1, 2, 5, 6, 11, 14, 15, 23, 30, 46, 51, 55, 66, 70, 94, 115, 119, 138, 154, 165, 210, 282, 310, 322, 345, 357, 382, 385, 462, 658, 682, 705, 759, 766, 805, 930, 966, 1146, 1155, 1270, 1426, 1491, 1551, 1581, 1645, 1705, 1771, 1915, 1974, 2046, 2170, 2298, 2415
Offset: 1

Views

Author

Amarnath Murthy, Dec 09 2003

Keywords

Examples

			After a(4)=6, with sigma(6)=12, the smallest number k such that sigma(k) is a multiple of 12 is 11, with sigma(11)=12. Thus a(5)=11.
		

Crossrefs

Cf. A090553.

Programs

  • Mathematica
    msa[n_]:=Module[{s1=DivisorSigma[1,n],n2=n+1},While[Mod[DivisorSigma[1,n2],s1]!=0,n2++];n2]; NestList[msa,1,60] (* Harvey P. Dale, Mar 20 2020 *)
  • PARI
    lista(nn) = {a = 1; print1(a, ", "); for (n = 1, nn, sa = sigma(a); a++; while (sigma(a) % sa, a++); print1(a, ", "););} \\ Michel Marcus, Oct 12 2013

Extensions

Corrected, extended and edited by John W. Layman, Aug 10 2004
Showing 1-1 of 1 results.