The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A104908 a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300. 3

%I #9 Sep 08 2022 08:45:17

%S 100,300,316,435,537,691,875,1114,1416,1801,2290,2913,3705,4713,5994,

%T 7624,9698,12335,15690,19958,25386,32291,41075,52248,66460,84538,

%U 107534,136785,173993,221322,281526,358106

%N a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300.

%H G. C. Greubel, <a href="/A104908/b104908.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)) with a(1) = 100, a(2) = 300.

%t a[n_]:= a[n]= If[n<3, 100*(2*n-1), Floor[Sqrt[a[n-1]^2 + a[n-2]^2]] ];

%t Table[a[n], {n, 40}] (* _G. C. Greubel_, Jun 27 2021 *)

%o (Magma)

%o A104908:= func< n| n lt 3 select 100*(2*n-1) else Floor(Sqrt(Self(n-1)^2 +Self(n-2)^2)) >;

%o [A104908(n): n in [1..40]]; // _G. C. Greubel_, Jun 27 2021

%o (Sage)

%o @CachedFunction

%o def a(n): return 100*(2*n-1) if (n<3) else floor(sqrt(a(n-1)^2 + a(n-2)^2))

%o [a(n) for n in (1..40)] # _G. C. Greubel_, Jun 27 2021

%Y Cf. A104803, A104909, A104910.

%K nonn

%O 1,1

%A _Zak Seidov_, Mar 29 2005

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 May 16 08:41 EDT 2024. Contains 372552 sequences. (Running on oeis4.)