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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166387 a(n) = sum (floor (j^2/n), 1 <= j <= n-1) - floor ((n-1)(n-2)/3), n >= 2. 0
0, 1, 1, 0, 1, 1, 2, 2, 0, 1, 3, 0, 1, 3, 4, 0, 2, 1, 3, 2, 1, 3, 6, 2, 0, 3, 3, 0, 3, 3, 6, 2, 0, 3, 7, 0, 1, 5, 6, 0, 2, 1, 5, 4, 3, 5, 10, 4, 2, 3, 3, 0, 3, 5, 8, 2, 0, 3, 9, 0, 3, 7, 10, 0, 2, 1, 5, 4, 3, 7, 12, 0, 0, 7, 5, 2, 5, 5, 12, 6, 0, 3, 9, 0, 1, 7, 8, 0, 4, 3, 7, 4, 5, 9, 16, 0, 4 (list; graph; refs; listen; history; internal format)
OFFSET

2,7

COMMENTS

a(n) = 0 when n = 2, any prime of the form 4k+1 with k >= 1 and any

product of these without repetition, e.g. 2x5x17.

CROSSREFS

a(n) = A166373 - A128422(2:)

Sequence in context: A035370 A163000 A105524 * A000209 A170982 A104245

Adjacent sequences:  A166384 A166385 A166386 * A166388 A166389 A166390

KEYWORD

nonn

AUTHOR

Christopher Hunt Gribble (chris.eveswell(AT)virgin.net), Oct 13 2009

EXTENSIONS

Corrected and enhanced by Christopher Hunt Gribble (chris.eveswell(AT)virgin.net), Dec 01 2009

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.