cp's OEIS Frontend

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.

A095761 a(n) = A014824(2*n-1).

This page as a plain text file.
%I A095761 #30 Feb 24 2024 01:09:15
%S A095761 1,123,12345,1234567,123456789,12345679011,1234567901233,
%T A095761 123456790123455,12345679012345677,1234567901234567899,
%U A095761 123456790123456790121,12345679012345679012343
%N A095761 a(n) = A014824(2*n-1).
%C A095761 Previous name was: Numbers whose square root shows strings of seemingly rational and irrational strings.
%H A095761 Muniru A Asiru, <a href="/A095761/b095761.txt">Table of n, a(n) for n = 1..101</a>
%H A095761 K. S. Brown, <a href="http://www.mathpages.com/home/kmath404.htm">Schizophrenic numbers</a>
%F A095761 a(1) = 1; for n > 1, a(n) = 100*a(n - 1) + 22*n - 21.
%F A095761 O.g.f.: x(1+21x)/((-1+x)^2*(1-100x)) = -17/(81(-1+x)) - 1/(81(-1+100*x)) - 2/(9(-1+x)^2). - _R. J. Mathar_, Feb 01 2008
%t A095761 RecurrenceTable[{a[1]==1, a[n]==100 a[n-1] + 22 n - 21}, a, {n, 20}] (* _Vincenzo Librandi_, Apr 03 2018 *)
%o A095761 (PARI) a=vector(10^3); a[1]=1; for(n=2, #a, a[n]=100*a[n-1]+22*n-21); a \\ _Altug Alkan_, Mar 30 2018
%o A095761 (GAP) a:=[1];; for n in [2..20] do a[n]:=100*a[n-1]+22*n-21; od; a; # _Muniru A Asiru_, Mar 30 2018
%o A095761 (Magma) [-19/81-(2/9)*(n-1)+(100/81)*100^(n-1): n in [1..20]]; // _Vincenzo Librandi_, Apr 03 2018
%Y A095761 Cf. A014824.
%K A095761 easy,nonn,base
%O A095761 1,2
%A A095761 _Michael Joseph Halm_, Jul 10 2004
%E A095761 Better name from _Georg Fischer_, Mar 30 2018