login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A317638
a(n) is the number of k with 1 <= k <= n-1 such that a(k)^2 + a(n-k)^2 <= n.
2
0, 1, 2, 3, 2, 2, 4, 4, 2, 3, 6, 5, 4, 2, 6, 4, 4, 7, 6, 5, 4, 10, 6, 4, 6, 8, 8, 3, 6, 8, 6, 5, 8, 11, 6, 6, 12, 10, 0, 10, 14, 9, 4, 10, 16, 8, 6, 11, 12, 8, 8, 16, 14, 6, 10, 13, 12, 6, 12, 14, 8, 8, 14, 13, 4, 10, 14, 16, 4, 12, 16, 13, 8, 16, 18, 10, 10
OFFSET
1,3
COMMENTS
See A317582 for similar sequences.
LINKS
EXAMPLE
For n = 5:
- a(1)^2 + a(4)^2 = 0^2 + 3^2 = 9 > 5,
- a(2)^2 + a(3)^2 = 1^2 + 2^2 = 5 <= 5,
- a(3)^2 + a(2)^2 = 2^2 + 1^2 = 5 <= 5,
- a(4)^2 + a(1)^2 = 3^2 + 0^2 = 9 > 5,
- hence a(5) = 2.
MATHEMATICA
a[n_] := a[n] = Length@ Select[ Range[n - 1], a[#]^2 + a[n - #]^2 <= n &]; a[0] = 0; Array[a, 80] (* Robert G. Wilson v, Aug 03 2018 *)
PROG
(PARI) a = vector(73); for (n=1, #a, a[n] = sum(k=1, n-1, a[k]^2 + a[n-k]^2 <= n); print1 (a[n] ", "))
CROSSREFS
Cf. A317582.
Sequence in context: A337121 A175470 A098534 * A002307 A287707 A029247
KEYWORD
nonn,look
AUTHOR
Rémy Sigrist, Aug 02 2018
STATUS
approved