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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115273 Floor(n/3)*(n mod 3). 2
1, 2, 0, 2, 4, 0, 3, 6, 0, 4, 8, 0, 5, 10, 0, 6, 12, 0, 7, 14, 0, 8, 16, 0, 9, 18, 0, 10, 20, 0, 11, 22, 0, 12, 24, 0, 13, 26, 0, 14, 28, 0, 15, 30, 0, 16, 32, 0, 17, 34, 0, 18, 36, 0, 19, 38, 0, 20, 40, 0, 21, 42, 0, 22, 44, 0, 23, 46, 0, 24, 48, 0, 25, 50, 0, 26, 52, 0, 27, 54, 0, 28, 56 (list; graph; refs; listen; history; internal format)
OFFSET

4,2

COMMENTS

Three arithmetic progressions interlaced: a(1)=1,2,0 and d=a(n+1)-a(n)=1,2,0. Cf. A115274(n)=n+A115273(n), n=1,2,3,...

FORMULA

a(3k+1)=k, a(3k+2)=2k, a(3k+3)=0, k=1, 2, ...

MATHEMATICA

Table[Floor[n/3]*Mod[n, 3], {n, 4, 104}]

CROSSREFS

Cf. A115274.

Sequence in context: A061930 A199335 A141660 * A194759 A126440 A131186

Adjacent sequences:  A115270 A115271 A115272 * A115274 A115275 A115276

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Jan 18 2006

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:57 EST 2012. Contains 205823 sequences.