24661

Appears in sequences

• Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.at n=32A000864
• Pseudoprimes to base 3.at n=36A005935
• Number of partitions of n with at least 1 odd and 1 even part.at n=38A006477
• Pseudoprimes to base 90.at n=35A020218
• Strong pseudoprimes to base 9.at n=25A020235
• Strong pseudoprimes to base 79.at n=20A020305
• Strong pseudoprimes to base 81.at n=35A020307
• Strong pseudoprimes to base 100.at n=33A020326
• Partial sums of A000009 (partitions into distinct parts).at n=48A036469
• Denominators of continued fraction convergents to sqrt(52).at n=10A041089
• Denominators of continued fraction convergents to sqrt(208).at n=10A041387
• Denominators of continued fraction convergents to sqrt(468).at n=14A041893
• Denominators of continued fraction convergents to sqrt(832).at n=10A042607
• Base-3 Euler-Jacobi pseudoprimes.at n=17A048950
• a(n) = n*(8*n^2 - 5)/3.at n=21A063523
• Number of paths to T(n,n,n) with T(i,j,k)= 0 if j>i or k>j and T(i,j,k) = T(i-1,j,k) + T(i,j-1,k) + T(i,j,k-1) and T(i,j,0) = 1.at n=6A065058
• Triangle read by rows: a(n,m) = T[n,m,m] where T[i,j,k] is the 3-dimensional pyramid defined by T[n,m,0]=1 and T[i,j,k]=0 if j>i or k>j and T[i,j,k]=T[i-1,j,k]+T[i,j-1,k]+T[i,j,k-1].at n=27A065078
• Number of partitions of 2n free of multiples of 8 such that 4 occurs at most once. All odd parts occur with even multiplicities. There is no restriction on the other even parts.at n=28A100684
• 3-almost prime octagonal numbers.at n=19A129927
• Expansion of g.f.: 1/((1 - x - x^2 + x^5 - x^7)*(1 - x^2 + x^5 + x^6 - x^7)).at n=23A147617