

A178408


Triangle T(n,k) read by rows. Each column is the Mobius function "recurrence" with the previous column as input.


0



1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 4, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,18


COMMENTS

The title says "recurrence" in quotes because the Mobius function does not have a regular recurrence. Row sums are A008683. Number of nonzero elements in the rows are A086436 which is essentially the same as A001222. Each row is a row in a Pascal like triangle.


LINKS

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


EXAMPLE

Table begins:
1,
0,1,
0,1,0,
0,1,1,0,
0,1,0,0,0,
0,1,2,0,0,0,
0,1,0,0,0,0,0,
0,1,2,1,0,0,0,0,
0,1,1,0,0,0,0,0,0,
0,1,2,0,0,0,0,0,0,0,


CROSSREFS

Cf. A008683, A086436, A001222.
Sequence in context: A221836 A279372 A086077 * A073345 A216511 A138088
Adjacent sequences: A178405 A178406 A178407 * A178409 A178410 A178411


KEYWORD

sign,tabl


AUTHOR

Mats Granvik, May 27 2010


STATUS

approved



