55404

Appears in sequences

• Number of n-bead bracelets (turnover necklaces) of two colors with 6 red beads and n-6 black beads.at n=35A005513
• Number of 3-voter voting schemes with n linearly ranked choices.at n=34A007009
• Number of strict first-order maximal independent sets in path graph.at n=38A007383
• Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,6).at n=17A018918
• 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=16A019579
• a(n) = n*(n - 1)^3/2.at n=19A019582
• Pisot sequences E(6,8), P(6,8).at n=32A020716
• Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=38A023434
• A054221 without cubes.at n=25A054224
• Expansion of 1/((1-2*x+x^2-x^3)*(1-x)).at n=18A077855
• Expansion of g.f. x/((1-x)*(1-3*x+2*x^2-x^3)).at n=12A137229
• a(n) = A000931(n+4) - A010060(n).at n=41A140514
• Number of reduced 3 X 3 magilatin squares with magic sum n.at n=35A174020
• Number of ways to place 2 nonattacking nightriders on an n X n cylindrical board.at n=18A196810
• (n-1)-st elementary symmetric function of the first n terms of the periodic sequence (1,1,1,3,1,1,1,3,...).at n=29A203235
• Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically.at n=5A208417
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically.at n=50A208420
• Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically.at n=4A208423
• Numbers that can be written as the average of two positive cubes in more than one way.at n=7A322102
• Expansion of Product_{k>=1} (1 + 3^(k-1)*x^k).at n=10A344062