21848

Appears in sequences

• Number of 2n-bead balanced binary strings, rotationally equivalent to reverse.at n=12A045653
• Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=24A090036
• a(1) = 4; then alternately add -4 and multiply by -2.at n=28A096406
• Numbers n such that A003313(3n) < A003313(n).at n=6A104699
• phi(n) + n is a cube.at n=30A114074
• a(n) = abs(A154879(n+1)).at n=15A115341
• Numbers k such that A003313(k) = A003313(6*k).at n=6A116461
• 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, -1, 1), (-1, 0, 0), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=9A148936
• 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, -1, 1), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 1, 0)}.at n=8A150166
• Third differences of the Jacobsthal sequence A001045.at n=16A154879
• Jacobsthal numbers A001045 alternatingly incremented by 3 and 5.at n=16A154890
• a(n) = (4^n + 8)/3.at n=8A155701
• Boundary area of the T-square fractal.at n=7A158494
• The left-hand half-triangle of A185356 (or A202690).at n=29A202816
• A triangle formed like Pascal's triangle, but with 4^n on the borders instead of 1.at n=37A227074
• A triangle formed like Pascal's triangle, but with 4^n on the borders instead of 1.at n=43A227074
• Number of partitions of n with difference 5 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=41A242696
• Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows.at n=35A326914
• Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), k>=0, k<=n<=k*2^(k-1), read by columns.at n=49A326962
• G.f. = Phi^2*F^4, where Phi = g.f. for A028930, F = g.f. for A028959.at n=14A328535