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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010764 [ n/2 ]%[ n/3 ]. 0
0, 0, 0, 1, 1, 0, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 6, 5, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 9, 10, 9, 10, 10, 10, 10, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 12, 12, 13, 12, 13, 13, 13, 13, 14, 13, 14, 14, 14, 14, 15, 14, 15, 15 (list; graph; refs; listen; history; internal format)
OFFSET

3,8

FORMULA

G.f.: x^6(1+x-x^2-x^3+x^4+2x^5-2x^7)/((1-x^2)(1-x^3)).

MAPLE

[ seq(floor(n/2) mod floor(n/3), n=3..100) ];

PROG

(PARI) a(n)=if(n<3, 0, (n\2)%(n\3))

CROSSREFS

a(n)=A008615(n), n>8.

Sequence in context: A054725 A064415 A086833 * A029383 A070098 A029233

Adjacent sequences:  A010761 A010762 A010763 * A010765 A010766 A010767

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)

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 23:53 EST 2012. Contains 205860 sequences.