205905
domain: N
Appears in sequences
- 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=35A001296
- Concatenation of the 5 prime factors of composite a(n) is a palindrome.at n=15A046454
- Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2).at n=21A100960
- Number of 0..n arrays x(0..3) of 4 elements with each no smaller than the sum of its two previous neighbors modulo (n+1).at n=33A207101
- a(n) is the smallest k such that the sum of the number of divisors of the n numbers from k to k+n-1 equals tau(k+n).at n=14A348837