32592

Appears in sequences

• a(n) = 4*a(n-1) - a(n-2), with a(0) = 0, a(1) = 3.at n=8A005320
• sec(tan(x)*tan(x))=1+12/4!*x^4+480/6!*x^6+32592/8!*x^8...at n=4A012394
• a(n) = 4*a(n-2) - a(n-4).at n=15A083336
• a(n)=((-1)^n/6)*sum_{i1+i2+i3+i4=2n} ((2*n)!/(i1! i2! i3! i4!))*B(i1+i2+i3) where B are the Bernoulli numbers.at n=5A124135
• Numerators of principal and intermediate convergents to 3^(1/2).at n=23A143642
• Numerators of the lower principal convergents and the lower intermediate convergents to 3^(1/2).at n=15A143643
• Arises in enumerating Huffman codes, compact trees, and sums of unit fractions.at n=17A194632
• 2^n minus the number of partitions of n.at n=15A208739
• List of triples (r,s,t): the matrix M = [[4,12,9][2,7,6][1,4,4]] is raised to successive powers, then (r,s,t) are the square roots of M[3,1], M[1,1], M[1,3] respectively.at n=26A249578
• Numerators of the other-side convergents to sqrt(3).at n=15A259593
• Number of length-n 0..7 arrays with every repeated value unequal to the previous repeated value plus one mod 7+1.at n=4A269775
• Number of length-5 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1.at n=6A269777
• Records of A058249: (Smallest prime >= 2^n) - (largest prime <= 2^n).at n=43A331620
• a(n) = A343046(n, n).at n=40A343047
• a(n) = A276085(A108951(n)).at n=50A346105