OFFSET
1,2
COMMENTS
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MAPLE
A007318 := proc(n) option remember; local t, r; t := 0 ; for r from 0 do if t+r+1 > n then return binomial(r, n-t) ; end if; t := t+r+1 ; end do: end proc:
isA175811 := proc(n) m := 0 ; for d in numtheory[divisors](n) minus {n} do m := m+A007318(d) ; end do; m < A007318(n) ; end proc:
for n from 1 to 120 do if isA175811(n) then printf("%d, ", n); end if; end do: # R. J. Mathar, Dec 06 2010
PROG
(PARI) b(n) = {my(m = 1); while (m*(m+1)/2 < n, m++); if (! ispolygonal(n, 3), m--); binomial(m, n - m*(m+1)/2); }
isok(n) = sumdiv(n, d, (d<n)* b(d)) < b(n); \\ Michel Marcus, Feb 07 2016
CROSSREFS
KEYWORD
nonn,less
AUTHOR
Vladimir Shevelev, Dec 05 2010
EXTENSIONS
Terms >25 from R. J. Mathar, Dec 06 2010
STATUS
approved