34000

Appears in sequences

• Number of ways to place two nonattacking queens on an n X n board.at n=16A036464
• Numbers k such that phi(k) = bigomega(k)*tau(k)^2.at n=36A068540
• a(n) = A052217(n)/3.at n=44A088405
• In triangular peg solitaire, number of distinct feasible pairs starting with one peg missing and finishing with one peg.at n=37A130515
• In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.at n=37A130516
• 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, 0, 0), (-1, 0, 1), (0, 1, -1), (1, -1, 1), (1, 0, 0)}.at n=10A148572
• Number of zig-zag paths from top to bottom of a rectangle of width 9 with n rows.at n=13A153362
• Number of zig-zag paths from top to bottom of a rectangle of width 9 with n rows whose color is that of the top right corner.at n=14A153363
• Number of zig-zag paths from top to bottom of a rectangle of width 9 with 2*n-1 rows whose color is that of the top right corner.at n=7A153366
• a(n) = smallest number which has in its Spanish name the letter "m" in the n-th position,or -1 if no such number exists.at n=14A164813
• a(n) = smallest number which has in its Spanish name the letter "l" in the n-th position, or -1 if no such number exists.at n=16A164814
• Integers that can be generated with a C/C++ expression that is shorter than their decimal representation.at n=33A168650
• Square root of v(2n)/v(2n-1), where v=A203773.at n=3A203774
• Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 2 and length 3 (n >= 3, 0 <= k <= n).at n=50A216726
• Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011.at n=8A260496
• Sequence A261220 shown in factorial base: a(n) = A007623(A261220(n)).at n=54A260743
• a(n) = n*(n + 1)*(n + 2)*(7*n - 5)/12.at n=15A264850
• a(n) = n*(2*n - 3 - (-1)^n)*(11*n + (-1)^n)/24.at n=33A308026
• Table read by rows, in which the n-th row lists all the primitive solutions k, in increasing order, such that k*sigma(k) = A337875(n).at n=29A337876
• Number of semicyclic pandiagonal Latin squares of order 2*n+1 with the first row in ascending order.at n=8A343867