This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276577 Row 5 of A276580: a(n) = A255415(n) modulo 11. 2
 0, 0, 4, 8, 5, 9, 2, 2, 6, 3, 7, 0, 4, 4, 1, 5, 9, 2, 8, 10, 3, 7, 0, 6, 10, 1, 5, 9, 4, 8, 1, 3, 7, 2, 6, 10, 3, 5, 0, 4, 8, 1, 9, 9, 2, 6, 10, 7, 0, 0, 4, 8, 5, 9, 2, 2, 6, 3, 7, 0, 4, 4, 1, 5, 9, 2, 8, 10, 3, 7, 0, 6, 10, 1, 5, 9, 4, 8, 1, 3, 7, 2, 6, 10, 3, 5, 0, 4, 8, 1, 9, 9, 2, 6, 10, 7, 0, 0, 4, 8, 5, 9, 2, 2, 6, 3, 7, 0, 4, 4, 1, 5, 9, 2, 8, 10, 3, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Seems to have a period of 48. LINKS Antti Karttunen, Table of n, a(n) for n = 1..1008 FORMULA a(n) = A255415(n) modulo 11. PROG (Scheme) (define (A276577 n) (modulo (A255415 n) 11)) CROSSREFS Cf. A003309, A255415, A276580. Sequence in context: A200695 A021677 A124193 * A011366 A005133 A198241 Adjacent sequences:  A276574 A276575 A276576 * A276578 A276579 A276580 KEYWORD nonn AUTHOR Antti Karttunen, Sep 13 2016 STATUS approved

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

Last modified November 22 05:52 EST 2018. Contains 317453 sequences. (Running on oeis4.)