|
|
A049805
|
|
Triangular array T read by rows: T(n,k) is the number of Farey fractions of order n that are <= 1/k for k=1..n, for n>=1.
|
|
11
|
|
|
2, 3, 2, 5, 3, 2, 7, 4, 3, 2, 11, 6, 4, 3, 2, 13, 7, 5, 4, 3, 2, 19, 10, 7, 5, 4, 3, 2, 23, 12, 8, 6, 5, 4, 3, 2, 29, 15, 10, 8, 6, 5, 4, 3, 2, 33, 17, 12, 9, 7, 6, 5, 4, 3, 2, 43, 22, 15, 11, 9, 7, 6, 5, 4, 3, 2, 47, 24, 16, 12, 10, 8, 7, 6, 5, 4, 3, 2
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
So, T(n, k) is also the index of fraction 1/k in the Farey fractions of order n. - Michel Marcus, Jun 27 2014
|
|
LINKS
|
Table of n, a(n) for n=1..78.
|
|
EXAMPLE
|
Rows: {2}; {3,2}; {5,3,2}; ...; e.g. in row 3, 5 reduced fractions (0/1,1/3,1/2,2/3,1/1) are <=1; 3 are <=1/2; 2 are <=1/3.
Triangle starts:
2;
3, 2;
5, 3, 2;
7, 4, 3, 2;
11, 6, 4, 3, 2;
13, 7, 5, 4, 3, 2;
...
|
|
MATHEMATICA
|
T[n_, k_] := Count[FareySequence[n], f_ /; f <= 1/k];
Table[T[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* Jean-François Alcover, Sep 25 2018 *)
|
|
PROG
|
(PARI) row(nn) = my(frow = farey(n)); for (k=1, n, print1(vecsearch(frow, 1/k), ", "); ); \\ Michel Marcus, Jun 27 2014
|
|
CROSSREFS
|
First column: T(n, 1) = A005728(n+1).
Cf. A006842, A006843.
Sequence in context: A108728 A331962 A302170 * A104887 A064886 A029600
Adjacent sequences: A049802 A049803 A049804 * A049806 A049807 A049808
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling
|
|
STATUS
|
approved
|
|
|
|