A071709 Array A(i,j)= T(prime(i)^j) read by antidiagonals, where T(x) denote the "type" of the integer x: T(m)=1 or 2 depending on whether 1 or 2 is a descendant of n in the Half-totient tree.

2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1

Offset

1,1

Links

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

K. S. Brown, The Half-Totient Tree

Example

Array begins (rows labeled i=1,2,..., columns labeled j=1,2,3,...):
2 2 1 2 1 2 1 2 1 2...
3 1 1 1 1 1 1 1 1 1...
5 2 2 2 2 2 2 2 2 2...

Crossrefs

Cf. A023022.

Sequence in context: A175077 A001030 A246140 * A131406 A029440 A061337

Adjacent sequences: A071706 A071707 A071708 * A071710 A071711 A071712

Keyword

easy,nonn,tabl

Author

Benoit Cloitre, Jun 03 2002

Status

approved