A319981 a(n) is the number of integer partitions of n with largest part <= 3 for which the index of the seaweed algebra formed by the integer partition paired with its weight is 0.
1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2
Offset: 1
Keywords
Links
- Muniru A Asiru, Table of n, a(n) for n = 1..1000
- V. Coll, A. Mayers, N. Mayers, Statistics on integer partitions arising from seaweed algebras, arXiv preprint arXiv:1809.09271 [math.CO], 2018.
- V. Dergachev, A. Kirillov, Index of Lie algebras of seaweed type, J. Lie Theory 10 (2) (2000) 331-343.
- Index entries for linear recurrences with constant coefficients, signature (0, 1).
Programs
-
GAP
a:=[1,1,1,2,2,1,2,1,2,1,2,1,2];; Concatenation(a,Flat(List([1..30],n->[0,2]))); # Muniru A Asiru, Dec 07 2018
-
Maple
1,1,1,2,2,1,2,1,2,1,2,1,2 seq(op([0,2]),n=1..30); # Muniru A Asiru, Dec 07 2018
-
Mathematica
Join[{1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1}, LinearRecurrence[{0, 1}, {2, 0}, 100]] (* Jean-François Alcover, Dec 07 2018 *)
Formula
For n>12: a(n)=2 if n is odd, a(n)=0 if n is even.
Comments