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.

A386688 Squares in A386687.

Original entry on oeis.org

0, 1, 9, 81, 225, 1369, 2209, 13689, 106929, 915849, 8105409, 72539289, 651627729, 1097530641, 1108290681, 2176502409, 4469591025, 21803770921, 26143332721, 47825753481, 253493117361, 396488086929, 845198906409, 4313600840241, 9044785577025, 50417568884089, 62908961921289
Offset: 1

Views

Author

Paolo Xausa, Jul 29 2025

Keywords

Crossrefs

Intersection of A000290 and A386687.

Programs

  • Mathematica
    Module[{s = 0, a = 0}, Table[If[IntegerQ[Sqrt[s += a]], a = k; s, Nothing], {k, 10^5}]]

Formula

a(n) = A386370(n)^2.

A386369 a(1) = 0, and for any n > 1, a(n) is the largest k < n such that a(1) + ... + a(k) is a square number.

Original entry on oeis.org

0, 1, 2, 2, 2, 2, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 18, 18, 18, 18, 18, 18, 18, 18, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26
Offset: 1

Views

Author

Rémy Sigrist, Jul 19 2025

Keywords

Comments

In other words: a(1) = 0, and for any n > 0, if a(1) + ... + a(n) is a square number then a(n+1) = n, otherwise a(n+1) = a(n).
This sequence is unbounded: if a(1) + ... + a(n) = u^2, then a(n+1) = n, u^2 + n * (2*u+n) = (u+n)^2, so a(1) + ... + a(m) is a square number for some m > n, and a(m+1) = m > a(n+1).

Examples

			Sequence begins:
  n   a(n)  a(1)+...+a(n)  Square?
  --  ----  -------------  -------
   1     0              0  Yes
   2     1              1  Yes
   3     2              3  No
   4     2              5  No
   5     2              7  No
   6     2              9  Yes
   7     6             15  No
   8     6             21  No
   9     6             27  No
  10     6             33  No
		

Crossrefs

See A385986 for a similar sequence.

Programs

  • Mathematica
    Module[{s = 0,a = 0}, Table[If[IntegerQ[Sqrt[s += a]], a = n-1]; a, {n, 100}]] (* Paolo Xausa, Jul 29 2025, after Rémy Sigrist *)
  • PARI
    { t = 0; v = 0; for (n = 1, 70, print1 (v", "); t += v; if (issquare(t), v = n;);); }

A386370 Square roots of partial sums of A386369 that are square numbers.

Original entry on oeis.org

0, 1, 3, 9, 15, 37, 47, 117, 327, 957, 2847, 8517, 25527, 33129, 33291, 46653, 66855, 147661, 161689, 218691, 503481, 629673, 919347, 2076921, 3007455, 7100533, 7931517, 9022563, 9100641, 11272057, 11437383, 15080379, 32539617, 37443597, 37821775, 53419727
Offset: 1

Views

Author

Rémy Sigrist, Jul 19 2025

Keywords

Examples

			A386369(1) + ... + A386369(6) = 3^2, so 3 belongs to this sequence.
		

Crossrefs

Programs

  • Mathematica
    Module[{s = 0, a = 0}, Table[If[IntegerQ[#], a = k; #, Nothing] & [Sqrt[s += a]], {k, 10^5}]] (* Paolo Xausa, Jul 29 2025, after Rémy Sigrist  *)
  • PARI
    { t = 0; v = 0; for (n = 1, 86903746, t += v; if (issquare(t), print1 (sqrtint(t) ", "); v = n;);); }

Formula

a(n) = sqrt(A386688(n)). - Paolo Xausa, Jul 29 2025

Extensions

Offset changed to 1 by Paolo Xausa, Jul 29 2025
Showing 1-3 of 3 results.