25992

Appears in sequences

• Generalized Fibonacci numbers A_{n,2}.at n=32A006207
• Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite VET = VPI-8 [Si17O34] starting with a T4 atom.at n=13A019250
• a(n) = n^2 * phi(n).at n=37A053191
• a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.at n=29A067817
• Generalized Catalan numbers 6*x*A(x)^2 -A(x) +1 -5*x =0.at n=5A068768
• Minimal peaks in digital expansions of Pi: positions of peaks equal to 1.at n=26A105275
• Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=38A108914
• Numerator of Euler(n, 8/17).at n=4A156632
• Numbers of the form p^3*q^2*r^2 where p, q, and r are distinct primes.at n=14A179695
• a(n) = 18*n^2.at n=38A195321
• Numbers n such that the binary XOR of the divisors of n (A178910) is a binary palindrome (A006995) and not a power of 2 (A000079).at n=24A226643
• a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=56A231686
• T(n,k)=Number of length n+2 0..k arrays with no pair in any consecutive three terms totalling exactly k.at n=47A245995
• Number of length 3+2 0..n arrays with no pair in any consecutive three terms totalling exactly n.at n=7A245998
• a(n) = ([n]_phi! - [n]_{1-phi}!)/sqrt(5), where [n]_q! is the q-factorial, phi = (1+sqrt(5))/2.at n=6A274985
• a(n) = n^2*(2*n - 3 - (-1)^n)/4.at n=37A303692
• a(n) = Sum_{p in P} y(1)*y(2), where P is the set of partitions of n, and y(k) is the number of parts with multiplicity at least k in p.at n=28A316861
• Positions k where A348733(k) is not multiplicative.at n=28A348740
• Refactorable numbers that are twice a square.at n=29A376114
• Number of integer partitions of n that cannot be partitioned into constant multisets with a common sum.at n=38A381993