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.

A254397 Initial digits of A237424 in decimal representation.

This page as a plain text file.
%I A254397 #5 Feb 27 2015 16:45:02
%S A254397 1,4,7,3,3,6,3,3,3,6,3,3,3,3,6,3,3,3,3,3,6,3,3,3,3,3,3,6,3,3,3,3,3,3,
%T A254397 3,6,3,3,3,3,3,3,3,3,6,3,3,3,3,3,3,3,3,3,6,3,3,3,3,3,3,3,3,3,3,6,3,3,
%U A254397 3,3,3,3,3,3,3,3,3,6,3,3,3,3,3,3,3,3
%N A254397 Initial digits of A237424 in decimal representation.
%C A254397 a(n) = A000030(A237424(n));
%C A254397 n with a(n) = 3: A237424(n) = (10^a+10^b+1)/3 with 0 <= b < a, see also A014132;
%C A254397 n with a(n) = 6: A237424(n) = (10^a+10^b+1)/3 with a = b, see also A199682, A254338;
%C A254397 length of k-th run of consecutive 3s = k+1, k > 0;
%C A254397 digits 0, 2, 5, 8 and 9 do not occur.
%H A254397 Reinhard Zumkeller, <a href="/A254397/b254397.txt">Table of n, a(n) for n = 1..10000</a>
%o A254397 (Haskell)
%o A254397 a254397 = a000030 . a237424
%Y A254397  Cf. A237424, A000030, A254339.
%K A254397 nonn,base
%O A254397 1,2
%A A254397 _Reinhard Zumkeller_, Feb 23 2015