This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A104908 #9 Sep 08 2022 08:45:17 %S A104908 100,300,316,435,537,691,875,1114,1416,1801,2290,2913,3705,4713,5994, %T A104908 7624,9698,12335,15690,19958,25386,32291,41075,52248,66460,84538, %U A104908 107534,136785,173993,221322,281526,358106 %N A104908 a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300. %H A104908 G. C. Greubel, <a href="/A104908/b104908.txt">Table of n, a(n) for n = 1..1000</a> %F A104908 a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)) with a(1) = 100, a(2) = 300. %t A104908 a[n_]:= a[n]= If[n<3, 100*(2*n-1), Floor[Sqrt[a[n-1]^2 + a[n-2]^2]] ]; %t A104908 Table[a[n], {n, 40}] (* _G. C. Greubel_, Jun 27 2021 *) %o A104908 (Magma) %o A104908 A104908:= func< n| n lt 3 select 100*(2*n-1) else Floor(Sqrt(Self(n-1)^2 +Self(n-2)^2)) >; %o A104908 [A104908(n): n in [1..40]]; // _G. C. Greubel_, Jun 27 2021 %o A104908 (Sage) %o A104908 @CachedFunction %o A104908 def a(n): return 100*(2*n-1) if (n<3) else floor(sqrt(a(n-1)^2 + a(n-2)^2)) %o A104908 [a(n) for n in (1..40)] # _G. C. Greubel_, Jun 27 2021 %Y A104908 Cf. A104803, A104909, A104910. %K A104908 nonn %O A104908 1,1 %A A104908 _Zak Seidov_, Mar 29 2005