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.
%I A036391 #34 Aug 02 2023 09:36:41
%S A036391 0,1,3,3,11,3,21,7,21,11,63,7,77,21,23,23,171,21,183,23,49,63,333,15,
%T A036391 231,77,183,49,473,23,441,87,147,171,161,49,671,183,161,47,903,49,903,
%U A036391 147,161,333,1521,47,903,231,343,161,1727,183,483,105,427,473,2439,47
%N A036391 a(n) = sum of order of a mod n, 0 < a < n, gcd(a, n) = 1.
%C A036391 Related to a problem of Arnold.
%C A036391 Row sums of triangle A139366. - _Wolfdieter Lang_, Sep 09 2008
%H A036391 Alois P. Heinz, <a href="/A036391/b036391.txt">Table of n, a(n) for n = 1..2000</a>
%H A036391 Pär Kurlberg and Carl Pomerance, <a href="http://arxiv.org/abs/1108.5209">On a problem of Arnold: the average multiplicative order of a given integer</a>, arXiv:1108.5209 [math.NT], 2012.
%F A036391 On the GRH, Kurlberg & Pomerance show that a(n) = n^2/log n exp(B log log n/log log log n (1 + o(1))), where B = A218342 = 0.345372.... - _Charles R Greathouse IV_, Oct 26 2012
%F A036391 If n is in A033948 then a(n) = Sum_{divisors d of phi(n)} phi(d)*d. - _Geoffrey Critzer_, Jan 24 2015
%p A036391 with(numtheory):
%p A036391 a:= n-> add(`if`(igcd(n, k)=1, order(k, n), 0), k=1..n-1):
%p A036391 seq(a(n), n=1..60); # _Alois P. Heinz_, Oct 28 2012
%t A036391 a[n_] := Sum[ If[ CoprimeQ[k, n], MultiplicativeOrder[k, n], 0], {k, 1, n-1}]; Table[a[n], {n, 1, 60}] (* _Jean-François Alcover_, Aug 19 2013 *)
%o A036391 (Haskell)
%o A036391 a036391 = sum . a139366_row -- _Reinhard Zumkeller_, May 01 2013
%K A036391 nonn,nice
%O A036391 1,3
%A A036391 _David W. Wilson_
%E A036391 Adapted to the definition: a(1)=0 by _Alois P. Heinz_, Oct 28 2012