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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212597 Number of ways of writing n in the form i*j+k*m with 0<i<=j, 0<k<=m, and (j<m or j=m and i<k). 1
0, 0, 1, 1, 3, 3, 5, 5, 7, 9, 10, 11, 14, 15, 16, 19, 20, 23, 24, 27, 28, 33, 30, 37, 36, 42, 40, 48, 44, 53, 49, 57, 55, 65, 55, 72, 64, 74, 70, 83, 72, 90, 77, 95, 87, 102, 84, 112, 94, 112, 104, 124, 102, 133, 109, 135, 123, 142, 117, 160, 128, 152, 138 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000

EXAMPLE

1*1+1*4 = 1*2+1*3 = 1*1+2*2 = 5, so a(5) = 3.

MAPLE

with(numtheory):

a:= proc(n) local j, l, m;

      add(add(add(`if`(j<m or j=m and l*m<(n-l)*j, 1, 0),

      m=select(h-> is(h>=sqrt(n-l)), divisors(n-l))),

      j=select(h-> is(h>=sqrt(l)), divisors(l))), l=1..n-1)

    end:

seq(a(n), n=1..100);  # Alois P. Heinz, May 24 2012

MATHEMATICA

a[n_] := Sum[Sum[Sum[If[j < m || j == m && l*m < (n-l)*j, 1, 0], {m, Select[Divisors[n-l], # >= Sqrt[n-l]&]}], {j, Select[Divisors[l], # >= Sqrt[l]&]}], {l, 1, n-1}];

Array[a, 100] (* Jean-Fran├žois Alcover, Mar 27 2017, after Alois P. Heinz *)

CROSSREFS

Cf. A007875, A094820.

Sequence in context: A095878 A077381 A157966 * A268188 A231608 A087715

Adjacent sequences:  A212594 A212595 A212596 * A212598 A212599 A212600

KEYWORD

nonn,look

AUTHOR

John W. Layman, May 22 2012

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 June 21 21:20 EDT 2018. Contains 305642 sequences. (Running on oeis4.)