Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A166387
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A166387 a(n) = sum (floor (j^2/n), 1 <= j <= n-1) - floor ((n-1)(n-2)/3), n >= 2. +0
1
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; listen)
OFFSET

2,7

COMMENT

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:)

KEYWORD

nonn,new

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

page 1

Search completed in 0.001 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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research