25004

Appears in sequences

• Number of 3-rowed binary matrices with n ones and no zero columns, up to row and column permutation.at n=31A058053
• Triangle read by rows in which each row is the inverse binomial transform of a diagonal of A089246.at n=51A089302
• Primitive sliding numbers (excludes multiples of 10): totals, including repetitions, of sums r + s, r >= s, such that 1/r + 1/s = (r + s)/10^k for some k >= 0.at n=36A103184
• Values of y in x^2 - 289 = 2*y^2.at n=13A106528
• Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=39A127022
• Expansion of q * psi(q^2) * psi(-q^9) / (phi(-q^3) * psi(-q^3)) in powers of q where phi(), psi() are Ramanujan theta functions.at n=56A139214
• Expansion of q * (psi(-q^3) * psi(q^6)) / (psi(-q) * phi(-q)) in powers of q where phi(), psi() are Ramanujan theta functions.at n=18A187100
• G.f.: (4-4*x-20*x^2)/(1-19*x+2*x^2+78*x^3).at n=3A203073
• Number of n-step walks (each step +-1 starting from 0) which are never more than 5 or less than -5.at n=15A216241
• Smallest j such that j*2*p(n)^3-1=q is prime, j*2*p(n)*q^2-1=r, j*2*p(n)*r^2-1=s, where r and s are also prime.at n=16A224611
• a(n) = Sum_{i=0..n} Sum_{j=0..n} (i XOR j), where XOR is the binary logical exclusive-or operator.at n=34A224923
• Expansion of q * (psi(q^3) * psi(q^6)) / (psi(q) * phi(q)) in powers of q where phi(), psi() are Ramanujan theta functions.at n=18A228447
• Smallest m such that A357477(m) = n.at n=40A357675