A024883 Duplicate of A024328.
0, 0, 3, 5, 7, 11, 13, 17, 30, 36, 46, 50, 60, 70, 74, 84, 117, 131, 139, 157, 171, 177, 193, 207, 221, 237, 294, 310, 330, 348
Offset: 1
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
A014306:= With[{ms= Table[m(m+1)(m+2)/6, {m,0,20}]}, Table[If[MemberQ[ms, n], 0, 1], {n,0,150}]]; Table[t=0; m=3; p=BitShiftRight[n]; n--; While[n>p, t += A014306[[n+1]]; n -= m++]; t, {n, 120}] (* G. C. Greubel, Feb 17 2022 *)
nmax=120
@CachedFunction
def b_list(N):
A = []
for m in range(ceil((6*N)^(1/3))):
A.extend([0]*(binomial(m+2, 3) - len(A)) + [1])
return A
A023533 = b_list(nmax+5)
def A014306(n): return 1 - A023533[n]
def b(n, j): return A014306(n-j+1) if ((sqrt(8*j+9) -3)/2).is_integer() else 0
@CachedFunction
def A024327(n): return sum( b(n, j) for j in (1..floor((n+1)/2)) )
[A024327(n) for n in (1..nmax)] # G. C. Greubel, Feb 17 2022