23229

Appears in sequences

• Denominators of continued fraction convergents to sqrt(215).at n=11A041401
• Denominators of continued fraction convergents to sqrt(860).at n=5A042661
• Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=39A063706
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=39A063708
• Expansion of g.f. x*(-1-x-3*x^2-x^3+2*x^5)/((2*x^3+x^2-1)*(x^4+1)).at n=25A107851
• G.f. x*(x^2+1)*(x^3-x-1)/((2*x^3+x^2-1)*(x^4+1)).at n=26A107854
• Expansion of x*(1+x)/(1-x^2-2*x^3).at n=26A159284
• Third accumulation array of Pascal's triangle (as a rectangle), by antidiagonals.at n=71A185779
• Third accumulation array of Pascal's triangle (as a rectangle), by antidiagonals.at n=72A185779
• Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+5x+5y>0.at n=18A211627
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) > number of parts of p.at n=48A241832
• T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 7.at n=37A264837
• Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 7.at n=7A264838
• The maximum number of coins that can be processed in n weighings that all are real except for one LHR-coin starting in the heavy state.at n=12A279674
• Number of nXn 0..1 arrays with every element unequal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A305483
• Number of nX6 0..1 arrays with every element unequal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A305487
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=60A305489
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.at n=15A360215
• a(n) = binomial(2*n-1,n) - binomial(n,2)*(binomial(n-1,2) + 2) - 1.at n=8A371003