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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026500 For n >= 3, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<=j<=k<=n. 0

%I #6 Mar 31 2012 13:50:34

%S 1,3,4,5,6,7,8,9,10,12,13,14,15,16,17,20,21,22,23,24,25,28,29,30,31,

%T 32,36,37,39,40,44,45,47,49,52,55,56,58,60,63,64,65,69,71,72,76,78,79,

%U 80,84,85,87,92,93,95,100,103,104,111,112,119

%N For n >= 3, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<=j<=k<=n.

%K nonn,easy

%O 1,2

%A _Clark Kimberling_

%E More terms from _Naohiro Nomoto_, Sep 15 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)