104960

Appears in sequences

• The Franel number a(n) = Sum_{k = 0..n} binomial(n,k)^3.at n=7A000172
• Array read by antidiagonals: Solutions to Schmidt's Problem.at n=43A094424
• Inverse modulo 2 binomial transform of 3^n.at n=11A100736
• Expansion of 1/sqrt(1-4*x-12*x^2+48*x^3).at n=9A106185
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=50A136862
• Numbers n such that phi(n)/n = 16/41.at n=24A176598
• Expansion of 1/(1-2*x^2-4*x^3). (2,4)-Padovan sequence.at n=18A176739
• Composite numbers m such that Product_{i=1..k} (p_i/(p_i-1)) / Sum_{i=1..k} (p_i/(p_i+1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=16A230112
• Square array A(n,k) = (n!)^3 [x^n] hypergeom([], [1, 1], z)^k read by antidiagonals.at n=52A287698
• Square array A(n, k) = Sum_{j=0..n} binomial(n,j)^k, n >= 0, k >= 0, read by antidiagonals.at n=62A309010
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j * binomial(n,j)^3.at n=43A336163
• Main diagonal of the square array A058395.at n=14A362179