66816

Appears in sequences

• Generalized tangent numbers d_(n,2).at n=23A000176
• Numbers that are the sum of 6 nonzero 8th powers.at n=33A003384
• Theta series of lattice D3 tensor D3* (dimension 9, det. 262144, min. norm 6).at n=34A033694
• Numbers k such that the k-th triangular number contains only digits {2,3,6}.at n=9A119155
• n! times partial sum of the sequence (1,Bernoulli numbers).at n=8A129716
• Wiener indexes of the complete binary trees with n levels, root being at level 0.at n=5A158681
• Number of permutations of length 3n with descent set {3, 6, ...} that avoid a certain pattern of length 4 or 5 (see Lewis, 2012, Appendix, for precise definition).at n=3A217826
• First position of A218860(n) in A066135.at n=25A218861
• Petersen graph (8,2) coloring a rectangular array: number of nX5 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph.at n=1A223689
• T(n,k)=Petersen graph (8,2) coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph.at n=16A223692
• Petersen graph (8,2) coloring a rectangular array: number of 2 X n 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph.at n=4A223693
• Number of binary pattern classes in the (3,n)-rectangular grid: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=6A225827
• Number of binary pattern classes in the (6,n)-rectangular grid: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=3A225830
• Square array read by antidiagonals: a(m,n) is the number of binary pattern classes in the (m,n)-rectangular grid, two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=48A225910
• Square array read by antidiagonals: a(m,n) is the number of binary pattern classes in the (m,n)-rectangular grid, two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=51A225910
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood.at n=16A281310
• Triangle read by rows: T(n,m) is the number of pattern classes in the (n,m)-rectangular grid with 8 colors and n>=m, two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=8A286919
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(k*((1+x)^k - 1)).at n=48A294118
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k grid up to horizontal and vertical reflections by a tile that is fixed under horizontal reflection only.at n=30A368218
• Number of polyforms with n cells on the faces of a pentagonal icositetrahedron up to rotation.at n=14A383808