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,1

Comments

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

Links

Table of n, a(n) for n=1..102.

Formula

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

Crossrefs

Sequence in context: A198517 A105385 A190227 * A129569 A266611 A286752

Adjacent sequences: A090623 A090624 A090625 * A090627 A090628 A090629

Keyword

nonn,base,tabl

Author

Reinhard Zumkeller, Dec 12 2003

Status

approved