login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064264 a(n) = 19*n mod 30. 2

%I

%S 0,19,8,27,16,5,24,13,2,21,10,29,18,7,26,15,4,23,12,1,20,9,28,17,6,25,

%T 14,3,22,11,0,19,8,27,16,5,24,13,2,21,10,29,18,7,26,15,4,23,12,1,20,9,

%U 28,17,6,25,14,3,22,11,0,19,8,27,16,5,24,13,2,21,10,29

%N a(n) = 19*n mod 30.

%C Paschal term in Julian calendar for a year with Golden Number n+10.

%D B. Blackburn and L. Hollford-Stevens, The Oxford Companion to the Year, Oxford, 1999; see p. 821.

%H Harry J. Smith, <a href="/A064264/b064264.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).

%p A064264:=n->19*n mod 30: seq(A064264(n), n=0..150); # _Wesley Ivan Hurt_, Apr 10 2017

%o (PARI) { for (n=0, 1000, write("b064264.txt", n, " ", 19*n % 30) ) } \\ _Harry J. Smith_, Sep 10 2009

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, Sep 24 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 11:57 EST 2021. Contains 341823 sequences. (Running on oeis4.)