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!)
A112282 a(n) = (-1)^n*(2*n+1) (mod 9). 1
1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2, 5, 6, 1, 1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2, 5, 6, 1, 1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2, 5, 6, 1, 1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2, 5, 6, 1, 1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2, 5, 6, 1, 1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..104.

FORMULA

Period 18 sequence: [1, 6, 5, 2, 0, 7, 4, 3, 8, 8, 3, 4, 7, 0, 2, 5, 6, 1].

MAPLE

seq(`mod`((-1)^n*(2*n+1), 9), n = 0..120); # G. C. Greubel, Nov 05 2019

MATHEMATICA

Table[Mod[(-1)^n*(2*n+1), 9], {n, 0, 120}] (* G. C. Greubel, Nov 05 2019 *)

PROG

(PARI) a(n)=((-1)^n*(2*n+1))%9

(MAGMA) [(-1)^n*(2*n+1) mod 9 : n in [0..120]]; // G. C. Greubel, Nov 05 2019

(Sage) [mod((-1)^n*(2*n+1), 9) for n in (0..120)] # G. C. Greubel, Nov 05 2019

(GAP) List([0..120], n-> (-1)^n*(2*n+1) mod 9 ); # G. C. Greubel, Nov 05 2019

CROSSREFS

Cf. A112280.

Sequence in context: A197517 A102079 A177938 * A098866 A144689 A221215

Adjacent sequences:  A112279 A112280 A112281 * A112283 A112284 A112285

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Sep 01 2005

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 01:31 EDT 2020. Contains 336361 sequences. (Running on oeis4.)