login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064263 a(n) = 11*n mod 30. 3
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, 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, 21, 2, 13, 24, 5, 16, 27, 8, 19, 0, 11, 22, 3, 14, 25, 6, 17, 28, 9, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Epact in Julian calendar for a year with Golden Number n+1.
REFERENCES
B. Blackburn and L. Hollford-Stevens, The Oxford Companion to the Year, Oxford, 1999; see p. 821.
LINKS
Index entries for linear recurrences with constant coefficients, 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).
MATHEMATICA
Mod[11*Range[0, 80], 30] (* Harvey P. Dale, Mar 13 2014 *)
PROG
(PARI) { for (n=0, 1000, write("b064263.txt", n, " ", 11*n % 30) ) } \\ Harry J. Smith, Sep 10 2009
CROSSREFS
Sequence in context: A202627 A257491 A169853 * A138838 A139337 A231115
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Sep 24 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 05:44 EDT 2024. Contains 371918 sequences. (Running on oeis4.)