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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174088 Number of pairs (i,j) such that i*j==0 (mod k), 0 <= i <= j < k. 1
1, 2, 3, 5, 5, 8, 7, 11, 12, 14, 11, 21, 13, 20, 23, 26, 17, 33, 19, 37, 33, 32, 23, 51, 35, 38, 42, 53, 29, 68, 31, 58, 53, 50, 59, 87, 37, 56, 63, 91, 41, 98, 43, 85, 96, 68, 47, 122, 70, 100, 83, 101, 53, 123, 95, 131, 93, 86, 59, 181, 61, 92, 138, 132, 113, 158, 67, 133, 113 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..69.

FORMULA

a(n) = ( A018804(n) + A000188(n) ) / 2 [Max Alekseyev, Sep 05 2010]

PROG

(PARI) a(n)={ my(ct=0); for(i=0, n-1, for(j=0, i, ct+=(Mod(i*j, n)==0) ) ); ct; } \\ Joerg Arndt, Aug 03 2013

CROSSREFS

Sequence in context: A063914 A209187 A166250 * A208323 A067284 A123339

Adjacent sequences:  A174085 A174086 A174087 * A174089 A174090 A174091

KEYWORD

nonn

AUTHOR

Russell Easterly, Mar 06 2010

EXTENSIONS

More terms from Max Alekseyev, Sep 05 2010

Better name from Joerg Arndt, Aug 03 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 20 04:05 EST 2017. Contains 294959 sequences.