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.

A093593 n! times sum of Farey fractions of order n.

This page as a plain text file.
%I A093593 #15 Feb 16 2025 08:32:53
%S A093593 1,3,15,84,660,4680,47880,463680,5261760,59875200,858211200,
%T A093593 11256537600,183697113600,2833294464000,47730114432000,
%U A093593 847372990464000,17250840262656000,329722245844992000,7359528574734336000,156922179527393280000,3601911423105515520000,84862054947209379840000
%N A093593 n! times sum of Farey fractions of order n.
%H A093593 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FareySequence.html">Farey Sequence</a>.
%e A093593 Multiplication of n-th-order positive Farey fractions by n! gives the integer sequence A002088(n), for n>=1. Arrange them in rows:
%e A093593 1
%e A093593 1 2
%e A093593 2 3 4 6
%e A093593 6 8 12 16 18 24
%e A093593 The sum over row 4 is a(4)=84.
%t A093593 Farey[n_] := Union[ Flatten[ Join[{0}, Table[a/b, {b, n}, {a, b}]]]]; Table[n!Plus @@ Farey[n], {n, 0, 20}] (* _Robert G. Wilson v_, Apr 06 2004 *)
%o A093593 (PARI) a(n) = my(list = List()); for (k=1, n, for (m=1, k, listput(list, m/k); ); ); n!*vecsum(Set(Vec(list))); \\ _Michel Marcus_, Mar 01 2023
%Y A093593 Cf. A002088, A092824, A093594.
%K A093593 nonn
%O A093593 1,2
%A A093593 _Clark Kimberling_, Apr 03 2004
%E A093593 More terms from _Robert G. Wilson v_, Apr 06 2004
%E A093593 More terms from _Michel Marcus_, Mar 01 2023