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

A166602 Numbers k such that Sum_{i=1..k} i^2 divides Product_{i=1..k} i^2.

Original entry on oeis.org

1, 7, 13, 17, 19, 24, 25, 27, 31, 32, 34, 37, 38, 43, 45, 47, 49, 55, 57, 59, 61, 62, 64, 67, 71, 73, 76, 77, 79, 80, 84, 85, 87, 91, 92, 93, 94, 97, 101, 103, 104, 107, 109, 110, 115, 117, 118, 121, 122, 123, 124, 127, 129, 132, 133, 137, 139, 142, 143, 144, 145, 147
Offset: 1

Views

Author

Alexander Adamchuk, Oct 18 2009

Keywords

Comments

Product_{i=1..k} i^2 = (k!)^2 and Sum_{i=1..k} i^2 = k*(k+1)*(2*k+1)/6. - J. Mulder (jasper.mulder(AT)planet.nl), Jan 25 2010

Examples

			a(2) = A125314(2) = 7.

Links

Crossrefs

Cf. A000330, A001044, A125294, A125314, A060462, A166604, A166605, A166606, A166607, A166608, A166609, A166610, A334735.
Cf. A067656. - R. J. Mathar, Oct 23 2009

Programs

  • Maple
    q:= k-> is(irem(k!^2, k*(k+1)*(2*k+1)/6)=0):
select(q, [$1..200])[];  # Alois P. Heinz, May 09 2020
  • Mathematica
    Cases[Range[2, 5000], k_ /; Divisible[Factorial[k - 1]^2, 1/6 (-1 + k) k (-1 + 2 k)]] - 1 (* J. Mulder (jasper.mulder(AT)planet.nl), Jan 25 2010 *)
  • PARI
    isok(k) = ((k!)^2 % (k*(k+1)*(2*k+1)/6)) == 0; \\ Michel Marcus, May 09 2020

Extensions

Terms below 5000 by J. Mulder (jasper.mulder(AT)planet.nl), Jan 25 2010
More terms copied from the b-file by R. J. Mathar, Feb 14 2010

A166604 Numbers k such that Sum_{i=1..k} i^4 divides Product_{i=1..k} i^4.

Original entry on oeis.org

1, 31, 59, 94, 104, 122, 133, 181, 206, 223, 244, 248, 283, 298, 318, 342, 356, 401, 406, 421, 422, 439, 444, 449, 451, 469, 479, 493, 496, 507, 528, 532, 536, 541, 555, 597, 631, 637, 643, 668, 701, 706, 712, 717, 721, 722, 754, 762, 795, 797, 801, 815, 842
Offset: 1

Views

Author

Alexander Adamchuk, Oct 18 2009

Keywords

Examples

			a(2) = A125314(4) = 31.

Links

Crossrefs

Cf. A125314, A166602, A060462, A166605, A166606, A166607, A166608, A166609, A166610, A181426, A334734.

Programs

  • Mathematica
    k = s = 1; p = 1; lst = {}; While[k < 1000, If[ Mod[p, s] == 0, AppendTo[lst, k]]; k++; s = s + k^4; p = p*k^4]; lst (* Robert G. Wilson v, Nov 02 2009 *)
Module[{nn=1000,c},c=Range[nn]^4;Select[Range[nn],Divisible[Times@@ Take[ c,#], Total[Take[c,#]]]&]] (* Harvey P. Dale, Dec 18 2013 *)

Extensions

a(15)-a(53) from Robert G. Wilson v, Nov 02 2009

A166605 Numbers k such that Sum_{i=1..k} i^5 divides Product_{i=1..k} i^5.

Original entry on oeis.org

1, 13, 64, 95, 111, 118, 123, 133, 134, 140, 151, 177, 199, 217, 229, 242, 255, 264, 274, 281, 302, 305, 325, 333, 338, 354, 359, 365, 376, 394, 411, 414, 431, 433, 440, 472, 475, 477, 489, 514, 525, 528, 529, 537, 547, 569, 574, 583, 584, 585, 589, 594, 615
Offset: 1

Views

Author

Alexander Adamchuk, Oct 18 2009

Keywords

Examples

			a(2) = A125314(5) = 13.

Links

Crossrefs

Cf. A125314, A166602, A060462, A166604, A166606, A166607, A166608, A166609, A166610.

Programs

  • Mathematica
    k = s = 1; p = 1; lst = {}; While[k < 100000, If[Mod[p, s] == 0, AppendTo[lst, k]]; k++; s = s + k^5; p = p*k^5]; lst  (* G. C. Greubel, May 18 2016 *)
Module[{nn=1000,i5},i5=Range[nn]^5;Position[Table[Times@@Take[i5,n]/Total[Take[i5,n]],{n,nn}],?IntegerQ]]//Flatten (* _Harvey P. Dale, Jan 18 2025 *)

Extensions

More terms from Max Alekseyev, Sep 29 2010

A166606 Numbers k such that Sum_{i=1..k} i^6 divides Product_{i=1..k} i^6.

Original entry on oeis.org

1, 1556, 1640, 3907, 5642, 6205, 7238, 8311, 10350, 11551, 12499, 13371, 13812, 17524, 17589, 18162, 18790, 21569, 21573, 22381, 22544, 23809, 24312, 24416, 24598, 24629, 25247, 25463, 26093, 26583, 26829, 27091, 27098, 28646, 28804
Offset: 1

Views

Author

Alexander Adamchuk, Oct 18 2009

Keywords

Examples

			a(2) = A125314(6) = 1556.

Crossrefs

Cf. A125314, A166602, A060462, A166604, A166605, A166607, A166608, A166609, A166610.

Programs

  • Mathematica
    k = s = 1; p = 1; lst = {}; While[k < 5000, If[Mod[p, s] == 0, AppendTo[lst, k]]; k++; s = s + k^6; p = p*k^6]; lst (* G. C. Greubel, May 18 2016 *)

Extensions

More terms from Max Alekseyev, Sep 30 2010

A166607 Numbers k such that Sum_{i=1..k} i^7 divides Product_{i=1..k} i^7.

Original entry on oeis.org

1, 733, 1637, 2096, 2367, 4231, 5674, 5839, 7585, 8344, 13719, 13753, 14983, 15151, 15197, 15257, 15757, 16595, 17305, 18791, 20701, 21442, 23652, 23738, 24519, 24789, 25474, 25916, 25933, 27474, 27487, 29185, 31455, 32846, 32950, 33421
Offset: 1

Views

Author

Alexander Adamchuk, Oct 18 2009

Keywords

Examples

			a(2) = A125314(7) = 733.

Crossrefs

Cf. A123314, A166602, A060462, A166604, A166605, A166606, A166608, A166609, A166610.

Programs

  • Mathematica
    With[{c=Range[40000]^7},Flatten[Position[#[[1]]/#[[2]]&/@Thread[ {Rest[ FoldList[ Times,1,c]],Accumulate[c]}],?IntegerQ]]] (* _Harvey P. Dale, Nov 16 2014 *)

Extensions

More terms from Max Alekseyev, Sep 30 2010
Showing 1-5 of 5 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.