Search: id:A018930
Results 1-1 of 1 results found.

%I A018930
%S A018930 3,4,12,84,132,12324,1836,105552,255084,197580,10358340,13775220,
%T A018930 1936434780,51299286012,123205977516,862441842612,1310543298204,
%U A018930 667510076211780,207181940072172,110912831751840,1698410314006284
%N A018930 Define {b(n)} by b(1)=3, b(n) (n >= 2) is smallest number such that b(1)^2+...+b(n)^2 
               = m^2 for some m and all b(i) are distinct. Sequence gives values 
               of b(n).
%t A018930 Mathematica program from Jean-Francois ALCOVER, Jan 26 2007:
%t A018930 f[n_]:=Module[{a={3}}, Do[AppendTo[a,First[y/. {ToRules[Reduce[{y^2+a.a 
               == x^2,x>0,y>0}, {y,x},Integers]]}]], {n-1}]; a]; f[21]//Timing
%Y A018930 Cf. A018928, A018929.
%Y A018930 Sequence in context: A052626 A122903 A059792 this_sequence A127689 A127690 
               A092417
%Y A018930 Adjacent sequences: A018927 A018928 A018929 this_sequence A018931 A018932 
               A018933
%K A018930 nonn
%O A018930 1,1
%A A018930 Charles Reed, charles.reed(AT)bbs.ewgateway.org
%E A018930 More terms from David W. Wilson (davidwwilson(AT)comcast.net).

Search completed in 0.001 seconds