33463

Appears in sequences

• First member of the Diophantine pair (m,k) that satisfies 6(m^2 + m) = k^2 + k: a(n) = m.at n=10A077288
• G.f.: A(x) = ( G(x)^5 - G(x^5) - 5*x*((1-x^4)/(1-x))/(1-x^5) )/(25*x^2) where G(x) is the g.f. of A110631.at n=18A111583
• Expansion of (3 -4*x -3*x^2)/((1-x^2)*(1-2*x-x^2)); a Pellian-related sequence.at n=12A114647
• a(n) = 22*n^2 + 1.at n=39A158537
• Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=12A241056
• Number of length 3+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=17A245872
• a(n) = F(n+1)*F(n+2) - F(n), where F = A000045 (Fibonacci numbers).at n=10A269803
• Numbers k such that the k-th lucky number (A000959) is divisible by k.at n=6A329528
• Number of ways to write n as a nonnegative linear combination of a strict integer partition.at n=25A365002
• Expansion of (1/x) * Series_Reversion( x / (1 + x + x^2 * (1 + x)^4) ).at n=9A389157