A090626 T(n,k) = if (k-th digit of pi) = (n-th digit of pi) then 1 else 0, 1<=k<=n (pi=3.14159... ), triangular array read by rows.

1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Author

Reinhard Zumkeller, Dec 12 2003

Keywords

• nonn
• base
• tabl

Comments

A064823(n) = Sum(T(n,k): 1<=k<=n).

Formula

T(n, k) = 0^((A000796(n) - A000796(k))^2).