26197

Appears in sequences

• Expansion of g.f. 1/((1 - 2*x)*(1 - 7*x)*(1 - 9*x)).at n=4A016312
• Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=41A030504
• At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=33A056640
• Largest proper divisor of the n-th Carmichael number (A002997).at n=27A081703
• G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=32A083707
• Number of squares in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid.at n=33A111746
• 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), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 1, -1)}.at n=9A148887
• Integers k such that for all m>k, d(m)/m < d(k)/k where d(j) = Min_{p & q odd primes, 2*j = p+q, p <= q} (q-p)/2.at n=23A335297
• G.f. A(x) satisfies A(x) = 1 + x/A(x)^2 * (1 - A(x) + A(x)^4).at n=11A377458