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 A040461 #22 Dec 26 2023 06:39:32 %S A040461 21,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42, %T A040461 1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1, %U A040461 42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42,1,42 %N A040461 Continued fraction for sqrt(483). %H A040461 <a href="/index/Con#confC">Index entries for continued fractions for constants</a>. %H A040461 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1). %F A040461 a(n) = a(n-2) for n >= 3. - _Wesley Ivan Hurt_, Sep 03 2022 %F A040461 From _Amiram Eldar_, Dec 26 2023: (Start) %F A040461 Multiplicative with a(2^e) = 42, and a(p^e) = 1 for an odd prime p. %F A040461 Dirichlet g.f.: zeta(s) * (1 + 41/2^s). (End) %p A040461 with(numtheory): Digits := 300: convert(evalf(sqrt(483)),confrac); %t A040461 ContinuedFraction[Sqrt[483],90] (* _Harvey P. Dale_, Oct 22 2011 *) %K A040461 nonn,cofr,easy,less,mult %O A040461 0,1 %A A040461 _N. J. A. Sloane_