25511

Appears in sequences

• A doubly-fractal sequence. Erase the first (leftmost) digit of every integer: what is left is the sequence itself. The erased digits, one by one, form also the sequence itself.at n=36A127274
• Triangle, read by rows, defined by T(n, k) = b(n) - b(k) - b(n-k) + 1, where b(n) = 5*b(n-1) - 4*b(n-2) + 3*b(n-3) - 2*b(n-4) - b(n-5) and b(0) = 0, b(1) = 1, b(2) = 5, b(3) = 21, b(4) = 88.at n=38A176483
• Triangle, read by rows, defined by T(n, k) = b(n) - b(k) - b(n-k) + 1, where b(n) = 5*b(n-1) - 4*b(n-2) + 3*b(n-3) - 2*b(n-4) - b(n-5) and b(0) = 0, b(1) = 1, b(2) = 5, b(3) = 21, b(4) = 88.at n=42A176483
• a(n) = 25*n^2 + 15*n + 1021.at n=31A214732
• Number of partitions p of n such that (# 1s in p) = (#1s in conjugate(p)).at n=52A240691
• Number of Schur rings over Z_{5^n}.at n=7A270786
• a(n) = n^7 + 6*n^6 + 26*n^5 + 73*n^4 + 152*n^3 + 222*n^2 + 203*n + 8.at n=3A270871
• Array T(n,k) of number of Schur rings over Z_{p^n} where n>=1 for p odd and k-th prime (by descending antidiagonals).at n=34A320948