login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101000 Periodic sequence with period 3. 4
0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3, 0, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

a(n) = floor((n mod 3)*3/2). - Reinhard Zumkeller, Jun 23 2007

a(n) = (1/9)*{13*(n mod 3)-2*[(n+1) mod 3]+[(n+2) mod 3]}, with n>=0. - Paolo P. Lava, Jun 25 2007

a(n) = 4 - a(n-1) - a(n-2) for n > 1. - Reinhard Zumkeller, Apr 13 2008

G.f.: x*(1+3*x)/(1-x^3). - Jaume Oliver Lafont, Mar 24 2009

a(n) = 2^(n mod 3) - 1. - Wesley Ivan Hurt, Apr 16 2014

MAPLE

A101000:=n->2^(n mod 3) - 1; seq(A101000(n), n=0..100); # Wesley Ivan Hurt, Apr 16 2014

MATHEMATICA

PadRight[{}, 120, {0, 1, 3}] (* Harvey P. Dale, Apr 28 2012 *)

Table[2^Mod[n, 3] - 1, {n, 0, 100}] (* Wesley Ivan Hurt, Apr 16 2014 *)

PROG

(PARI) a(n)=n%3+(n%3==2) \\ Jaume Oliver Lafont, Mar 24 2009

(PARI) a(n)=2^(n%3)-1 \\ Jaume Oliver Lafont, Mar 24 2009

CROSSREFS

Sequence in context: A014513 A144388 A133513 * A035653 A126595 A286096

Adjacent sequences:  A100997 A100998 A100999 * A101001 A101002 A101003

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Jun 17 2007

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 May 22 18:53 EDT 2019. Contains 323481 sequences. (Running on oeis4.)