48852

Appears in sequences

• Numbers k such that k^2 contains every digit at least once.at n=19A054038
• a(n) = n*(n+1)*(n^2 + 2)/6.at n=23A071239
• Number of linear arrangements of n blue, n red and n green items such that there are no adjacent items of the same color.at n=6A110706
• (k^2)-th k-smooth number for k = prime(n).at n=29A133581
• Number of Hi-Lo arrangements HL(m,n) of a deck with n suits and m ranks in each suit, m>=1, n>=1.at n=33A143381
• Numbers n such that n^2 contains every decimal digit exactly once.at n=19A156977
• 26-gonal pyramidal numbers: a(n) = n*(n+1)*(8*n-7)/2.at n=23A256646
• Least positive integer k such that prime(k)-k, prime(k)+k, prime(k*n)-k*n, prime(k*n)+k*n, prime(k)+k*n and prime(k*n)+k are all prime.at n=1A259492
• T(n,k) = number of linear arrays of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.at n=48A283613
• a(n) = 4*n*(n^2 + 2).at n=22A292022
• Number of permutations of 6 copies of 1..n with no element equal to another within a distance of 1.at n=3A321382
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k with no element equal to another within a distance of 1.at n=33A322093
• Numbers k such that k and k+1 have the same sum of powerful divisors (A183097) and this sum is larger than 1.at n=15A349063
• a(n) is the number of sets of distinct four-cuboid combinations that fill an n X n X n cube excluding combinations that contain cube-shaped cuboids.at n=36A386756