|
%I #24 Jul 03 2023 23:21:00
%S 6,20,56,140,256,404,584,796,1040,1316,1624,1964,2336,2740,3176,3644,
%T 4144,4676,5240,5836,6464,7124,7816,8540,9296,10084,10904,11756,12640,
%U 13556,14504,15484,16496,17540,18616,19724,20864,22036,23240,24476,25744,27044,28376,29740,31136,32564,34024,35516,37040,38596
%N Number of cyclotomic cosets of 9 mod 10^n.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3, -3, 1).
%F Conjecture: a(n) = 4*(4*n^2-7*n-1) for n>2. a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) for n>5. G.f.: 2*x*(8*x^4-13*x^3-7*x^2-x-3) / (x-1)^3. - _Colin Barker_, Apr 13 2013
%e a(2) = 20 because there are 20 cyclotomic cosets of 9 mod 100:
%e {1, 9, 81, 29, 61, 49, 41, 69, 21, 89}
%e {3, 27, 43, 87, 83, 47, 23, 7, 63, 67}
%e {11, 99, 91, 19, 71, 39, 51, 59, 31, 79}
%e {13, 17, 53, 77, 93, 37, 33, 97, 73, 57}
%e {2, 18, 62, 58, 22, 98, 82, 38, 42, 78}
%e {4, 36, 24, 16, 44, 96, 64, 76, 84, 56}
%e {6, 54, 86, 74, 66, 94, 46, 14, 26, 34}
%e {8, 72, 48, 32, 88, 92, 28, 52, 68, 12}
%e {10, 90}
%e {30, 70}
%e {20, 80}
%e {40, 60}
%e {50}
%e {5, 45}
%e {15, 35}
%e {55, 95}
%e {65, 85}
%e {25}
%e {75}
%e {0}
%t a[n_] := DivisorSum[10^n, EulerPhi[#]/MultiplicativeOrder[9, #]&]; Array[a, 50] (* _Jean-François Alcover_, Dec 10 2015, adapted from PARI *)
%o (PARI) for(n=1,50,print1(sumdiv(10^n, d, eulerphi(d)/znorder(Mod(9, d)))", "))
%Y Cf. A006694, A220468.
%K base,nonn
%O 1,1
%A _V. Raman_, Jan 27 2013
|
