48924

Appears in sequences

• a(n) = T(n,n), T given by A026552. Also a(n) is the number of integer strings s(0),...,s(n) counted by T, such that s(n)=0.at n=14A026553
• a(n) = self-convolution of row n of array T given by A026519.at n=7A027262
• Self-convolution of row n of array T given by A026552.at n=7A027272
• Self-convolution of array T given by A026082.at n=7A027315
• Duplicate of A027315.at n=7A027321
• Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).at n=32A075134
• Numbers n with omega(n) = omega of 3 nearest larger and 3 nearest smaller neighbors.at n=28A101936
• Numbers n such that 2*n and n^3 have the same digit sum.at n=19A266315
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 785", based on the 5-celled von Neumann neighborhood.at n=37A273559
• a(n) = 81*n^2 - 69*n + 24.at n=25A304616
• Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h X 2h X 2h where the walk starts at the middle of the box's edge.at n=37A336862
• Terms of A319928 that are congruent to 4 modulo 8: Numbers k == 4 (mod 8) such that there is no other m such that (Z/mZ)* is isomorphic to (Z/kZ)*, where (Z/kZ)* is the multiplicative group of integers modulo k.at n=38A372755