524800

Appears in sequences

• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.at n=21A000749
• a(n) = (2^n + 2^[ n/2 ] )/2.at n=18A001445
• a(n) = (4^n + 4^[ n/2 ] )/2.at n=8A001446
• Numbers that are the sum of 3 positive 9th powers.at n=17A003392
• a(n) = 2^(n-1)*( 2^n + (-1)^n ).at n=10A003665
• Numbers that are the sum of at most 3 positive 9th powers.at n=32A004887
• Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.at n=20A005418
• a(n) = 2^(n-1)*(1+2^n).at n=10A007582
• a(n) = 4^n*(4^n+1)/2.at n=5A026244
• Number of reversible strings with n beads of 4 colors.at n=10A032121
• a(n) = n^2*(n^2 + 1)/2.at n=32A037270
• Sum of every 4th entry of row n in Pascal's triangle, starting at binomial(n,2).at n=21A038505
• Number of elements of GF(2^n) with trace 0 and subtrace 1.at n=21A038519
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=21A038521
• Number of undirected walks of length n+1 on an oriented triangle, visiting n+2 vertices, with n "corners"; the symmetry group is C3. Walks are not self-avoiding.at n=19A051437
• a(n) = (n^10 + n^5)/2.at n=4A071236
• a(n) is the number of rotation-reflection inequivalent solutions to the all-ones lights out problem on an n X n square.at n=58A075463
• Numbers which do not appear prematurely in the binary Champernowne word (A030190).at n=29A083655
• Numbers n which when converted to base 9, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.at n=15A091083
• Sum of next n numbers/n if n divides the sum else n times the sum of next n numbers.at n=31A094260