The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036465 If n^2 = Sum_{i} b(i)^2 for positive integers b(i) < n, then a(n) is the maximum value of min(b(i)). 1

%I #27 May 08 2022 09:21:24

%S 1,1,2,3,3,2,4,4,6,6,6,5,7,9,8,8,9,8,12,8,12,8,12,15,13,12,14,20,18,

%T 14,16,18,17,21,18,14,19,19,24,23,21,18,24,27,23,20,24,23,30,24,26,28,

%U 27,33,28,28,40,30,36,28,31,34,32,39,36,31,34,35,42,30

%N If n^2 = Sum_{i} b(i)^2 for positive integers b(i) < n, then a(n) is the maximum value of min(b(i)).

%H Alois P. Heinz, <a href="/A036465/b036465.txt">Table of n, a(n) for n = 2..800</a>

%e a(9) = 4 since 9^2 = 7^2 + 4^2 + 4^2.

%p b:= proc(n, i) option remember; (s-> `if`(i=1, 1,

%p `if`(s>=n and issqr(n), isqrt(n), max(

%p `if`(s>n, 0, b(n-s, i)), b(n, i-1)))))(i^2)

%p end:

%p a:= n-> b(n^2, n-1):

%p seq(a(n), n=2..75); # _Alois P. Heinz_, Nov 03 2020

%t b[n_, i_] := b[n, i] = Function[s, If[i == 1, 1,

%t If[s >= n && IntegerQ@Sqrt[n], Sqrt[n], Max[

%t If[s > n, 0, b[n-s, i]], b[n, i-1]]]]][i^2];

%t a[n_] := b[n^2, n-1];

%t Table[a[n], {n, 2, 75}] (* _Jean-François Alcover_, May 08 2022, after _Alois P. Heinz_ *)

%K nonn

%O 2,3

%A _Erich Friedman_

%E Title improved by _Sean A. Irvine_, Nov 03 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 20:39 EDT 2024. Contains 373507 sequences. (Running on oeis4.)