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.

A255405 a(n) = floor((2/sqrt(Pi))^n).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 9, 11, 12, 14, 16, 18, 20, 23, 26, 29, 33, 37, 42, 47, 53, 60, 68, 77, 87, 98, 111, 125, 141, 159, 180, 203, 229, 258, 292, 329, 371, 419, 473, 534, 602, 680, 767, 865, 977, 1102, 1244, 1403, 1584, 1787, 2016, 2275, 2567
Offset: 0

Views

Author

Kival Ngaokrajang, Feb 22 2015

Keywords

Comments

Inspired by squaring the circle and Vitruvian Man, but starting with a unit circle and a square whose sides are of length sqrt(Pi), A002161. a(n) is the curvature (rounded down) of the n-th circle. See illustrations in the links.

Crossrefs

Programs

  • Mathematica
    Table[Floor[(2/Sqrt[Pi])^n], {n,0,50}] (* G. C. Greubel, Jan 09 2017 *)
  • PARI
    {for(n=1,100,a=floor(2^n/sqrt(Pi)^n);print1(a,", "))}

Formula

a(n) = floor((2/sqrt(Pi))^n).