A261209 First differences of partitions of n in the ordering A080577.

1, 2, 0, 1, 3, 1, 1, 0, 0, 1, 4, 2, 1, 0, 2, 1, 0, 1, 0, 0, 0, 1, 5, 3, 1, 1, 2, 2, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 6, 4, 1, 2, 2, 3, 0, 1, 0, 3, 1, 1, 1, 2, 0, 0, 1, 0, 0, 2, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1

Offset: 1

Author

Peter Luschny, Aug 12 2015

Keywords

• nonn
• tabf

Examples

			For n=6:
[6]
[4, 1]
[2, 2]
[3, 0, 1]
[0, 3]
[1, 1, 1]
[2, 0, 0, 1]
[0, 0, 2]
[0, 1, 0, 1]
[1, 0, 0, 0, 1]
[0, 0, 0, 0, 0, 1]
		

Crossrefs

Cf. A080577.

Programs

Sage

def A261209(n):
    delta = lambda p: [p[i]-p[i+1] for i in (0..len(p)-2)]+[p[-1]] if p else []
    return [delta(p) for p in Partitions(n)]
[A261209(n) for n in (1..6)]