22484

Appears in sequences

• a(n) is the decimal concatenation of n and n^2.at n=21A053061
• a(n) = floor(e^n mod n^e).at n=42A066433
• Numbers which are the sum of two positive cubes and divisible by 11.at n=31A101852
• 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, 1, 1), (0, -1, 0), (0, 1, 1), (1, 0, -1)}.at n=9A148954
• a(n) = Sum_{d|n} A007955(d) * A000027(n/d) = Sum_{d|n} A007955(d) * (n/d), where A007955(m) = product of divisors of m.at n=27A174932
• Number of binary sequences of length n having exactly one conjugate at Hamming distance 2.at n=21A179677
• Number of triangular nXnXn arrays of occupancy after each element moves to some neighbor and with no occupancy greater than 4.at n=3A217242
• T(n,k)=Number of triangular nXnXn arrays of occupancy after each element moves to some neighbor and with no occupancy greater than k.at n=24A217245
• Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 2,-2 -1,0 -1,2 1,0 or 0,-1.at n=5A264374
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 2,-2 -1,0 -1,2 1,0 or 0,-1.at n=33A264379
• Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 with each element having directed index change 2,-2 -1,0 -1,2 1,0 or 0,-1.at n=2A264384
• Number of Eulerian cycles in the n-antiprism graph.at n=4A297384