31745

Appears in sequences

• Consider the family of simple graphs. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those graphs on n edges.at n=33A098234
• a(n) = n^3 - n^2 + 1.at n=32A100104
• Where records appear in A109734.at n=41A109740
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, 0, -1), (1, 1, -1), (1, 1, 1)}.at n=8A149780
• a(n) = 8^n - 4^n + 1.at n=5A155629
• a(n) = 31*2^n + 1.at n=10A206371
• Number of partitions of n such that (least part) < (multiplicity of greatest part).at n=51A240178
• a(n) = 31*n^2 + 1.at n=32A247155
• Number of (not necessarily maximal) cliques in the n-halved cube graph.at n=7A295922
• Number of n X 6 0..1 arrays with every element unequal to 0, 1, 2, 6 or 7 king-move adjacent elements, with upper left element zero.at n=9A305038
• Number of maximal antichains of nonempty subsets of {1..n}.at n=6A326359