This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110269 n mod 2 + n mod 3. 3
 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (-1,0,1,1). FORMULA a(n) = A000035(n) + A010872(n). G.f.: -x*(2+4*x+3*x^2) / ( (x-1)*(1+x)*(1+x+x^2) ). - R. J. Mathar, Mar 06 2014 MATHEMATICA Table[Mod[n, 2]+Mod[n, 3], {n, 0, 120}] (* or *) LinearRecurrence[{-1, 0, 1, 1}, {0, 2, 2, 1}, 120] (* or *) PadRight[{}, 120, {0, 2, 2, 1, 1, 3}] (* Harvey P. Dale, Jun 02 2019 *) CROSSREFS Cf. A110270. Sequence in context: A226290 A235342 A079692 * A238280 A326644 A120964 Adjacent sequences:  A110266 A110267 A110268 * A110270 A110271 A110272 KEYWORD nonn,easy AUTHOR Reinhard Zumkeller, Jul 18 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.

Last modified October 19 13:01 EDT 2019. Contains 328222 sequences. (Running on oeis4.)