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.

A355068 Square array read by upwards antidiagonals: T(n,k) = k-th digit after the decimal point in decimal expansion of 1/n, for n >= 1 and k >= 1.

This page as a plain text file.
%I A355068 #34 Jun 25 2022 10:01:29
%S A355068 0,5,0,3,0,0,2,3,0,0,2,5,3,0,0,1,0,0,3,0,0,1,6,0,0,3,0,0,1,4,6,0,0,3,
%T A355068 0,0,1,2,2,6,0,0,3,0,0,1,1,5,8,6,0,0,3,0,0,0,0,1,0,5,6,0,0,3,0,0,0,9,
%U A355068 0,1,0,7,6,0,0,3,0,0,0,8,0,0,1,0,1,6,0
%N A355068 Square array read by upwards antidiagonals: T(n,k) = k-th digit after the decimal point in decimal expansion of 1/n, for n >= 1 and k >= 1.
%C A355068 First row is all zeros since n=1 has all zeros after the decimal point.
%F A355068 1/n = Sum_{k>=1} T(n, k)*10^-k, for n > 1.
%e A355068 Array begins:
%e A355068       k=1  2  3  4  5  6  7  8
%e A355068   n=1:  0, 0, 0, 0, 0, 0, 0, 0,
%e A355068   n=2:  5, 0, 0, 0, 0, 0, 0, 0,
%e A355068   n=3:  3, 3, 3, 3, 3, 3, 3, 3,
%e A355068   n=4:  2, 5, 0, 0, 0, 0, 0, 0,
%e A355068   n=5:  2, 0, 0, 0, 0, 0, 0, 0,
%e A355068   n=6:  1, 6, 6, 6, 6, 6, 6, 6,
%e A355068   n=7:  1, 4, 2, 8, 5, 7, 1, 4,
%e A355068   n=8:  1, 2, 5, 0, 0, 0, 0, 0,
%e A355068 Row n=7 is 1/7 = .142857142857..., whose digits after the decimal point are 1,4,2,8,5,7,1,4,2,8,5,7, ...
%o A355068 (PARI) T(n,k) = my(r=lift(Mod(10,n)^(k-1))); floor(10*r/n)%10;
%o A355068 (Python) def T(n,k): return (10*pow(10,k-1,n)//n)%10
%Y A355068 Cf. A020806, A021017, A021018.
%Y A355068 Cf. A048962, A257927.
%Y A355068 Cf. A061480 (diagonal).
%Y A355068 Cf. A355202 (binary).
%K A355068 base,easy,nonn,tabl
%O A355068 1,2
%A A355068 _Chittaranjan Pardeshi_, Jun 17 2022