Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115273
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115273 Floor(n/3)*(n mod 3). +0
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; listen)
OFFSET

4,2

COMMENT

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: A117946 A061930 A141660 this_sequence A126440 A131186 A137320

Adjacent sequences: A115270 A115271 A115272 this_sequence A115274 A115275 A115276

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research