26460

Appears in sequences

• Numbers n such that n is a substring of its square in base 5 (written in base 10).at n=19A018829
• Triangle T(n,k) read by rows, arising in enumeration of catafusenes.at n=60A024462
• Number of rods required to make a 3-D cube of side length n.at n=20A059986
• a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.at n=41A064651
• Numbers k such that sigma(k^2 + 1) == 0 (mod k).at n=35A067719
• Fourth power of lower triangular matrix of A056857 (successive equalities in set partitions of n).at n=31A078939
• Numbers n such that 3*2^(n-1) - 1 is prime.at n=36A091997
• Products x*y*z arising from A102505.at n=30A102793
• Number triangle T(n,k) = C(n,n-k)*C(n+1,n-k).at n=50A103371
• Fourth column of PE^4.at n=7A129333
• Rectangular array read by antidiagonals: a(n, k) is the number of ways to put k labeled objects into n labeled boxes so that there are exactly two boxes with exactly one object (n, k >= 2).at n=41A131105
• Triangle read by rows: A001263 * A127648 as infinite lower triangular matrices.at n=49A132813
• A001263 * A127773.at n=40A132819
• Partition number array, called M32(-1), related to A001497(n-1,m-1) = |S2(-1;n,m)| (generalized Stirling2 triangle).at n=49A143171
• Partition number array, called M32(-1), related to A001497(n-1,m-1) = |S2(-1;n,m)| (generalized Stirling2 triangle).at n=46A143171
• Number of cycles of length 3 in the queen graph associated with an n X n chessboard.at n=15A144298
• T(n,k) is the number of order-decreasing and order-preserving partial transformations (of an n-chain) of width (width(alpha) = |Dom(alpha)|) and waist (waist(alpha) = max(Im(alpha))) both equal to k.at n=61A145034
• Triangle read by rows: T(n, k) = (2^(n-k)*3^k + 2^k*3^(n-k))*binomial(n, k).at n=33A154692
• Triangle read by rows: T(n, k) = (2^(n-k)*3^k + 2^k*3^(n-k))*binomial(n, k).at n=30A154692
• Multiplicative order of 2 in Z/mZ with m=A104017(n).at n=27A165139