26325

Appears in sequences

• 12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10*n-7)/6.at n=25A007587
• a(n) = floor(n*(n-1)*(n-2)*(n-3)/16).at n=27A011926
• Numerators of continued fraction convergents to sqrt(183).at n=8A041338
• Numerators of continued fraction convergents to sqrt(732).at n=2A042408
• Odd numbers divisible by exactly 7 primes (counted with multiplicity).at n=25A046320
• A049031/2.at n=34A049032
• Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.at n=12A087415
• Fifth column (m=4) of (1,3)-Pascal triangle A095660.at n=24A095661
• A certain partition array in Abramowitz-Stegun order (A-St order), called M_3(5)/M_3.at n=32A134274
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 01010-11111-00100 pattern in any orientation.at n=13A147347
• Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(2*i-1) ) and m = 1, read by rows.at n=17A156696
• Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(2*i-1) ) and m = 1, read by rows.at n=18A156696
• Numbers m such that m*reversal(m) contains every decimal digit exactly once.at n=13A178929
• Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-2,0,1,2}, n=3*r+p_i, and define a(-2)=1. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,1,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^2-1) with x=2*cos(Pi/9).at n=41A187499
• Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-2,0,1,2}, n=3*r+p_i, and define a(-2)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,3,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^2-1) with x=2*cos(Pi/9).at n=38A187501
• Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-2,0,1,2}, n=3*r+p_i, and define a(-2)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,4,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^2-1) with x=2*cos(Pi/9).at n=37A187502
• Odd deficient numbers whose abundancy is closer to 2 than any smaller odd deficient number.at n=8A188597
• Denominator of the average height of a binary search tree on n elements.at n=13A195583
• Odd numbers of the form p^(1+4k) * r^2, where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1 that are closer to being perfect than previous terms.at n=3A228059
• Denominator of Sum_{k=1..n} 1/(k(k+1)(k+2)(k+3)) = Sum_{k=1..n} 1/Pochhammer(k,4).at n=24A230340