33840

Appears in sequences

• Expansion of ( 1-x-x^2 ) / ( 1-2*x-2*x^2+x^3+x^4 ).at n=12A052960
• McKay-Thompson series of class 10D for the Monster group.at n=12A058100
• Numbers k such that prime(k+1)^2 == prime(k)^2 (mod k).at n=34A067783
• Continued exponent expansion of the power series 1/(1-x); odd terms being numerators and even terms being denominators of the rational terms of the expansion: 1/(1-x) = e^[(a(1)/a(2))*x*e^[(a(3)/a(4))*x*e^[(a(5)/a(6))*x*e^[...]]]].at n=9A071787
• Expansion of (1+x)^2/((1-2x)(1-3x)).at n=8A085277
• Consider a single king on an infinite chessboard. This sequence gives number of n-move paths when king starting at origin reaches the origin again for the first time at step n.at n=7A098070
• McKay-Thompson series of class 10D for the Monster group with a(0) = 6.at n=12A132130
• a(n) = Sum_{k=0..n} C(n,floor(k/2))*(-1)^k*3^(n-k).at n=9A133443
• a(n) = 64*n^2 - 16.at n=22A157913
• a(n) = 529*n^2 - 2*n.at n=7A158364
• Number of reduced 3 X 3 semimagic squares with distinct nonnegative integer entries and maximum entry n.at n=15A173727
• a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=31A231675
• Values of Euler's totient phi for A050498.at n=3A339883
• Number of binary strings of length n which are losing configurations in the palindrome game.at n=19A362368
• a(n) = lcm({i, i = 1..n}) / Product_{2 <= p < n, p prime} p.at n=47A362988
• Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of regions formed.at n=23A371374
• Expansion of (1/x) * Series_Reversion( x / (1 + x + x^4 * (1 + x)^2) ).at n=13A389132