OFFSET
1,1
COMMENTS
A squarefree subsequence of tetrahedral numbers T(n) = C(n+2,3) = n*(n+1)*(n+2)/6.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
EXAMPLE
165 = 9*10*11/6 = 3*5*11
286 = 11*12*13/6 = 2*11*13
455 = 13*14*15/6 = 5*7*13
9139 = 37*38*39/6 = 13*19*37
MATHEMATICA
Select[Table[n*(n + 1)*(n + 2)/6, {n, 1, 2000}], FactorInteger[#][[;; , 2]] == {1, 1, 1} &] (* Amiram Eldar, Jul 26 2022 *)
PROG
(Python)
from math import comb
from itertools import count, islice
from collections import deque, Counter
from sympy import factorint
def A356095_gen(): # generator of terms
c, d = deque([Counter(factorint(i)) for i in range(1, 4)]), Counter(factorint(6))
for k in count(1):
a = sum(c, start=Counter())-d
if len(a) == 3 == sum(a.values()):
yield comb(k+2, 3)
c.popleft()
c.append(Counter(factorint(k+3)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Massimo Kofler, Jul 26 2022
STATUS
approved
