262912
domain: N
Appears in sequences
- a(n) = n^2*(n^2+3)/4.at n=31A039623
- Number of strings of length n over GF(4) with trace 0 and subtrace 0.at n=10A073995
- Number of strings of length n over GF(4) with trace 1 and subtrace 1.at n=10A073998
- Structured rhombic triacontahedral numbers (vertex structure 11).at n=31A100164
- Number of binary pattern classes in the (2,n)-rectangular grid; two patterns are in same class if one of them can be obtained by reflection or rotation of the other one.at n=9A132390
- Number of binary pattern classes in the (2,n)-rectangular grid: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=10A225826
- Number of binary pattern classes in the (10,n)-rectangular grid: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=2A225834
- a(n) = 2^(n-2)*(2^(n+4)-(-1)^n+13).at n=8A240526
- Numbers that can be written as the average of two positive cubes in more than one way.at n=16A322102
- Triangle read by rows: T(n,k) is the number of series-reduced rooted trees whose leaves are sets of colors with a total of n elements using exactly k colors.at n=24A330763
- If the binary expansion of A354780(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=25A354781
- If the binary expansion of A354757(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=52A354783