A360215 - cp's OEIS frontend

A360215 a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.

%I A360215 #5 Jan 31 2023 08:52:05
%S A360215 1,1383,4157,6548,8633,9884,12503,12920,15357,15812,18146,18126,19755,
%T A360215 20895,22106,23229,23246,23685,22118,25142,25884,27894,29448,28149,
%U A360215 29703,30285,31914,30966,34007,34380,34390,35082,35894,34389,36891,37035,37425,35907,35895,38856
%N A360215 a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.
%H A360215 Wikipedia, <a href="https://en.wikipedia.org/wiki/Icosahedral_number">Icosahedral number</a>
%Y A360215 Cf. A006564, A275154, A350205, A360214, A360216.
%K A360215 nonn
%O A360215 1,2
%A A360215 _Ilya Gutkovskiy_, Jan 30 2023

cp's OEIS Frontend

A360215 a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.