|
%I #17 Jun 24 2018 18:28:32
%S 0,11,22,3,14,25,6,17,28,9,20,1,12,23,4,15,26,7,18,29,10,21,2,13,24,5,
%T 16,27,8,19,0,11,22,3,14,25,6,17,28,9,20,1,12,23,4,15,26,7,18,29,10,
%U 21,2,13,24,5,16,27,8,19,0,11,22,3,14,25,6,17,28,9,20
%N a(n) = 11*n mod 30.
%C Epact in Julian calendar for a year with Golden Number n+1.
%D B. Blackburn and L. Hollford-Stevens, The Oxford Companion to the Year, Oxford, 1999; see p. 821.
%H Harry J. Smith, <a href="/A064263/b064263.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_30">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t Mod[11*Range[0,80],30] (* _Harvey P. Dale_, Mar 13 2014 *)
%o (PARI) { for (n=0, 1000, write("b064263.txt", n, " ", 11*n % 30) ) } \\ _Harry J. Smith_, Sep 10 2009
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, Sep 24 2001
|
