50765
domain: N
Appears in sequences
- a(n) = n^3 + 3*n + 1.at n=37A005491
- Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct products f*g with f,g in R and 1 <= deg(f),deg(g) <= n.at n=7A073961
- Integers that are Rhonda numbers to base 12.at n=24A100971
- Ceiling((n+1/n)^3).at n=36A197773
- Square array read by antidiagonals arising in the enumeration of corners.at n=23A259101
- Square array read by antidiagonals arising in the enumeration of corners.at n=25A259101
- Number of compositions (ordered partitions) of n into distinct prime powers (1 excluded).at n=47A331847