cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A167912 a(n) = (1/(3^n)^2) * Sum_{k=0..(3^n-1)} binomial(2k,k).

Original entry on oeis.org

1, 217, 913083596083, 18744974860247264575032720770000376335095039
Offset: 1

Views

Author

Alexander Adamchuk, Nov 15 2009

Keywords

Comments

Note that a(n) mod 27 = a(n) mod 9 = a(n) mod 3 = 1.
The Maple program yields the first seven terms; easily adjustable for obtaining more terms. However, a(4) has 44 digits, a(5) has 140 digits, a(6) has 432 digits and a(7) has 1308 digits. - Emeric Deutsch, Nov 22 2009

Crossrefs

Programs

  • Maple
    a := proc (n) options operator, arrow: (sum(binomial(2*k, k), k = 0 .. 3^n-1))/3^(2*n) end proc: seq(a(n), n = 1 .. 7); # Emeric Deutsch, Nov 22 2009
  • Mathematica
    Table[(1/3^n)^2 * Sum[Binomial[2 k, k], {k, 0, 3^n - 1}], {n, 1, 5}] (* G. C. Greubel, Jul 01 2016 *)

Extensions

a(4) from Emeric Deutsch, Nov 22 2009