23375

Appears in sequences

• a(n) = 2nd elementary symmetric function of the first n+1 positive integers congruent to 1 mod 4.at n=9A024378
• Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2*n+3)*(2*n-1).at n=26A030440
• Denominators of continued fraction convergents to sqrt(644).at n=10A042237
• Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=29A045187
• a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals prime(n).at n=32A070901
• Square root of n has the same nonzero digit in each of the first 4 places to the right of the decimal point.at n=9A073585
• a(n) = a(n-1) - a(n-2) + a(n-3) + a(n-4), a(0)=4, a(1)=1, a(2)=-1, a(3)=1.at n=39A073937
• Let F(x) = 1 + x + 4x^2 + 9x^3 + ... = g.f. for A002835 (solid partitions restricted to two planes) and write F(x) = 1/Product_{n>=1} (1-x^n)^a(n).at n=31A080207
• Least pentagonal number P(m) > P(n) such that P(m)+P(n) is again a pentagonal number, 0 if no such m exists.at n=15A136114
• a(n) = 81*n^2 - 2*n.at n=16A157507
• a(n) is the smallest number whose English name has the letter "i" in the n-th position, or -1 if no such number exists.at n=39A164793
• Number of subsets of {1,...,n} having mean=median.at n=18A212146
• Number of nX3 0..2 arrays with every element equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=6A277654
• Number of nX7 0..2 arrays with every element equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=2A277658
• T(n,k)=Number of nXk 0..2 arrays with every element equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=38A277659
• T(n,k)=Number of nXk 0..2 arrays with every element equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=42A277659
• a(n) = 5*(3*n+1)*(9*n+8)/2 (n>=0).at n=18A304508
• Heinz numbers of knapsack partitions such that no addition of one part up to the maximum is knapsack.at n=3A326018
• a(n) = A333552(A333551(n)): indices of terms in Recamán's sequence A005132 where the construction avoided a record-sized collision.at n=45A333553
• Numbers k such that k-1, k and k+1 are all composite with four, five and six (not necessarily distinct) prime factors respectively.at n=2A342246