OFFSET
0,4
COMMENTS
Equivalently, number of distinct envelopes up to rotation of the polyominoes of order n, n >= 0. - Francois Alcover, Feb 28 2017
a(n) is the number of times that the statement "x + y <= n + 1 and x * y >= n" is true, for x taking values from 1 to n, and y taking values from x to n. - John Mason, Feb 25 2022
LINKS
K. S. Brown, More info
FORMULA
EXAMPLE
From Francois Alcover, Feb 28 2017: (Start)
a(3) = 2:
The two possible envelopes are
|*|
|*|
|*| [3,1]
and
|*| |
|*|*| [2,2] (End)
MATHEMATICA
a[0] = 1; a[n_] := (1/2)*(Floor[(n+1)/2] - Floor[Sqrt[n-1]] + n*(n+1)/2 - Sum[Floor[(n-1)/i], {i, 1, n}]); Table[a[n], {n, 0, 58}] (* Jean-François Alcover, Feb 01 2018, from PARI *)
PROG
(PARI) for(n=1, 100, print1(1/2*(n*(n+1)/2+floor((n+1)/2)-floor(sqrt(n-1))-sum(i=1, n, floor((n-1)/i))), ", "))
(Python)
from math import isqrt
def A071764(n): return ((s:=isqrt(n-1))*(s-1)+1+(n>>1)+(n*(n+1)>>1)>>1)-sum((n-1)//k for k in range(1, s+1)) if n else 1 # Chai Wah Wu, Oct 31 2023
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 04 2002
STATUS
approved