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.

A102766 Numbers n that can be chopped into two parts, which when added and squared result in n.

Original entry on oeis.org

1, 81, 100, 2025, 3025, 9801, 10000, 88209, 494209, 998001, 1000000, 4941729, 7441984, 23804641, 24502500, 25502500, 28005264, 52881984, 60481729, 99980001, 100000000, 300814336, 493817284, 1518037444, 6049417284, 6832014336, 9048004641, 9999800001, 10000000000
Offset: 1

Views

Author

Bodo Zinser, Feb 10 2005

Keywords

Examples

			a(7) = 88209 is a term as (88+209)^2 = 297^2 = 88209.
		

Crossrefs

Supersequence of A238237.

Programs

  • Python
    from math import isqrt
    from itertools import count, islice
    def ok(n):
        if n == 1: return True
        r = isqrt(n)
        if r**2 != n: return False
        s = str(n)
        return any(int(s[:i])+int(s[i:])== r for i in range(1, len(s)))
    def agen(): yield from (k**2 for k in count(1) if ok(k**2))
    print(list(islice(agen(), 29))) # Michael S. Branicky, Dec 29 2024

Formula

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

Extensions

a(1)=1 prepended by Max Alekseyev, Aug 04 2017
a(27) and beyond from Michael S. Branicky, Dec 29 2024