44217

Appears in sequences

• Number of 3-voter voting schemes with n linearly ranked choices.at n=32A007009
• Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=15A019579
• a(n) = n*(n - 1)^3/2.at n=18A019582
• Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3).at n=66A046765
• Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 3).at n=66A046777
• Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.at n=33A057258
• The terms of A073213 (sums of two powers of 17) divided by 2.at n=13A073221
• Numbers which are the sum of two positive cubes and divisible by 17.at n=33A099178
• Records in the sequence A024573 defined by [1/{n*e}], {x} := x - [x].at n=18A101262
• Numbers whose fifth powers are closer to cubic numbers than square numbers.at n=6A117594
• Numbers n such that n^5 and a cube are between consecutive squares.at n=15A173341
• Numbers x such that 0 < |x^5 - y^3| < x^(7/3) for some number y.at n=8A173352
• Triangle T(n,k) read by rows: number of height-2-restricted finite functions.at n=38A187105
• Number of distinct values taken by 7th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=14A215796
• Petersen graph (3,1) coloring a rectangular array: number of n X 4 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=2A223552
• Petersen graph (3,1) coloring a rectangular array: number of nX6 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=1A223554
• T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=17A223556
• T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=22A223556
• Petersen graph (3,1) coloring a rectangular array: number of 2 X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=5A223557
• Petersen graph (3,1) coloring a rectangular array: number of 3 X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=3A223558