A350698 Consider the positive squares summing to n as obtained by the greedy algorithm; a(n) is the least of these squares.

1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 4, 1, 1, 16, 1, 1, 1, 4, 1, 1, 1, 4, 25, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 36, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 49, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 4, 1, 64, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 4, 1, 1, 16, 81, 1, 1, 1

Offset

1,4

Links

Table of n, a(n) for n=1..84.

Formula

a(n^2) = n^2.

a(n) = A350674(n, A053610(n)).

Example

For n = 13:
- 13 = 3^2 + 2^2,
- so a(13) = 2^2.

Prog

(PARI) a(n, e=2) = { my (r=0); while (n, r=sqrtnint(n, e); n-=r^e); r^e }

Crossrefs

Cf. A053610, A350674.

Sequence in context: A364360 A085731 A131301 * A335324 A366245 A083730

Adjacent sequences: A350695 A350696 A350697 * A350699 A350700 A350701

Keyword

nonn

Author

Rémy Sigrist, Jan 12 2022

Status

approved