Rare find

OEIS_03. OEIS A300000-

github.com/ishandutta2007/OEIS_03

Vaya's read on this project

Problem, audience, market, and the verdict — sign in to see it.

Updates

June 2026
  • Expansion of e.g.f. exp( (1 - (1+x)^4)/4 ).
  • Square array A(n,k), n >= 1, k >= 0, read by antidiagonals downwards,…
  • Square array A(n,k), n >= 1, k >= 0, read by antidiagonals downwards,…
  • Square array A(n,k), n >= 1, k >= 0, read by antidiagonals downwards,…
  • a(n) = Sum_{k=0..n} binomial(n+k,2*k) * (binomial(n+2*k,k) - binomial…
  • a(n) = Sum_{k=0..n} binomial(n+3*k,4*k) * binomial(n+4*k,k).
  • a(n) = Sum_{k=0..n} binomial(n+k,2*k) * binomial(n+2*k,k-1).
  • a(n) = Sum_{k=0..n} binomial(n+3*k,4*k) * binomial(n+4*k,k-1).
  • a(n) = Sum_{k=0..n} binomial(n+2*k,3*k) * binomial(n+3*k,k-1).
  • a(n) = Sum_{k=0..n} binomial(n+2*k,3*k) * (binomial(n+3*k,k) + binomi…
  • a(n) = Sum_{k=0..n} binomial(n+3*k,4*k) * (binomial(n+4*k,k) + binomi…
  • a(n) = Sum_{k=0..n} binomial(n+3*k,4*k) * (binomial(n+4*k,k) - binomi…
  • a(n) = Sum_{k=0..n} binomial(n+2*k,3*k) * (binomial(n+3*k,k) - binomi…
  • a(n) = Sum_{k=0..n} binomial(n+k,2*k) * (binomial(n+2*k,k) + binomial…
  • Triangle T(n,k), n >= 0, 0 <= k <= (3^n-1)/2, read by rows, where T(n…
  • Triangle T(n,k), n >= 0, 0 <= k <= (4^n-1)/3, read by rows, where T(n…
  • Replace system rm with fileopen output
  • Triangle T(n,k), n >= 0, 0 <= k <= (4^n-1)/3, read by rows, where T(n…
  • a(n) = (1/2) * Sum_{k=0..floor(n/3)} 3^(n-2*k) * binomial(2*n-4*k+2,2…
  • a(n) = (1/2) * Sum_{k=0..floor(n/3)} 2^(n-k) * binomial(2*n-4*k+2,2*k…