19172

Appears in sequences

• "CGJ" (necklace, element, labeled) transform of 1,3,5,7...at n=7A032150
• Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3, Pi/5, Pi/7).at n=16A054887
• a(n) = prime(n)^2 - prime(n+1).at n=33A062235
• a(n) = 3^n - 2^n + 1.at n=9A083323
• Number of ways to write prime(n) as sum of distinct divisors of prime(n)+1.at n=80A085496
• 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, 0), (-1, -1, 1), (0, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=9A149845
• 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, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1), (1, 1, 1)}.at n=7A151006
• Half the number of (n+1) X 2 binary arrays with no 2 X 2 subblock containing exactly one 1.at n=7A184189
• Half the number of (n+1)X9 binary arrays with no 2X2 subblock containing exactly one 1.at n=0A184196
• T(n,k)=Half the number of (n+1)X(k+1) binary arrays with no 2X2 subblock containing exactly one 1.at n=28A184197
• T(n,k)=Half the number of (n+1)X(k+1) binary arrays with no 2X2 subblock containing exactly one 1.at n=35A184197
• Square roots of highly composite numbers, floored down: a(n) = A000196(A002182(n)).at n=62A263096
• Total sum of parts which are squares in all partitions of n.at n=26A342228
• a(n) = Sum_{k=0..n} (-1)^(n-k) * k^(3*n).at n=3A349902
• a(n) = (1/4) * Sum_{k=0..n} (k+2) * binomial(2*k+2,2*n-2*k+1).at n=9A391829