262080

Appears in sequences

• Number of ways of writing n as a sum of 10 squares.at n=12A000144
• Theta series of {D_10}^{+} lattice.at n=24A004532
• Theta series of {D_10}* lattice.at n=24A008426
• Theta series of D_10 lattice.at n=6A008432
• Expansion of tanh(log(1+x))*log(1+x)/2.at n=10A024330
• Largest number having binary order n (A029837) and of which the number of divisors is maximal in that range of g(k) = n.at n=18A036493
• Theta series for 10-dimensional 4-modular lattice Q10 with minimal norm 4.at n=12A037219
• A triangle related to A000045 (Fibonacci numbers).at n=38A039948
• Number of 2n-bead balanced binary strings of fundamental period 2n, rotationally equivalent to complement.at n=18A045663
• There are exactly n integer-sided triangles of area a(n).at n=38A051586
• Expansion of e.g.f. x/((1-x)*(1-3*x)).at n=6A052698
• A simple context-free grammar in a labeled universe: labeled version of A052710.at n=7A052725
• Number of 4-ary sequences with primitive period n.at n=9A054719
• Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.at n=17A056767
• a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=34A060549
• a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=35A060549
• a(n) = (2n+1)*(2n+2)*(2n+3).at n=31A069072
• a(n) = (4*n-1)*4*n*(4*n+1).at n=16A069140
• List of codewords in binary lexicode with Hamming distance 12 written as decimal numbers.at n=3A075952
• Product{<n/k>: k=1,2,...,n}, where <x> denotes the integer second nearest to x. (For x=(2h+1)/2, <x> is defined to be h, not h+1; if x is an integer, then <x> is defined to be x+1.)at n=11A075998