login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A346598
a(n) is the number of terms in A344005 that are equal to n.
3
2, 2, 2, 3, 2, 4, 3, 5, 2, 4, 4, 6, 2, 4, 7, 5, 4, 6, 4, 3, 4, 4, 6, 8, 4, 6, 7, 6, 6, 8, 5, 7, 4, 6, 4, 9, 2, 4, 8, 8, 6, 8, 4, 10, 8, 4, 8, 13, 6, 6, 7, 6, 6, 6, 8, 11, 4, 4, 10, 12, 2, 8, 13, 8, 8, 8, 4, 6, 8, 8, 10, 12, 2, 8, 9, 6, 6, 8, 8, 17, 6, 4, 10, 10, 6, 4, 11, 8, 10, 10, 8, 7, 4, 6, 11, 12
OFFSET
1,1
COMMENTS
If A344005(n) = m then n <= m*(m+1).
EXAMPLE
A344005(n) is equal to 4 just for n = 5, 10, and 20, so a(4) = 3.
PROG
(Python)
# uses[python code from A344005]
def A346598(n):
return sum(1 for m in range(1, n*(n + 1) + 1) if A344005(m) == n)
# Chai Wah Wu, Jul 29 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved