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.

A235037 Number of terms of A014847 that are not greater than n.

Original entry on oeis.org

1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10
Offset: 1

Views

Author

Bruno Berselli, Jan 05 2014 - sequence suggested by Umberto Cerruti (University of Turin, Italy)

Keywords

Examples

			a(6)=3 because the terms of A014847 not greater than 6 are 1,2,6.
a(17)=4 because the terms of A014847 not greater than 17 are 1,2,6,15.
		

Crossrefs

Cf. A014847.

Programs

  • Mathematica
    a[n_] := Module[{ris}, ris = {}; Do[If[Mod[Binomial[2 k, k], k] == 0, AppendTo[ris, k]], {k, n}]; Length[ris]]; Table[a[n], {n, 100}]