|
|
A235037
|
|
Number of terms of A014847 that are not greater than n.
|
|
1
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
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.
|
|
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}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Bruno Berselli, Jan 05 2014 - sequence suggested by Umberto Cerruti (University of Turin, Italy)
|
|
STATUS
|
approved
|
|
|
|