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.
%I A007960 #26 Dec 15 2022 14:22:31 %S A007960 1,3,6,10,12,15,19,21,28,30,36,45,51,54,55,60,63,66,78,82,87,91,100, %T A007960 102,105,109,117,120,123,132,135,136,147,150,153,156,163,165,168,171, %U A007960 174,186,190,201,208,210,213,231,235,253,258,267,276,280,285,300,306,307 %N A007960 Positive numbers k with the property that some permutation of the digits of k is a triangular number. %C A007960 Leading zeros may be omitted from the permutation of the digits of k to get T. But the number of digits of T must be <= the number of digits of k. - _N. J. A. Sloane_, Dec 14 2007 %C A007960 Working modulo 9, A010878(A000217(j)) is in the set {0, 1, 3, 6} for all j, never in {2, 4, 5, 7, 8}. Since permutation of decimal digits does not change values mod 9, A010878(n) is also one of {0,1,3,6}. - _R. J. Mathar_, Jan 08 2008 %H A007960 Alois P. Heinz, <a href="/A007960/b007960.txt">Table of n, a(n) for n = 1..10000</a> %H A007960 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">Only Problems, Not Solutions!</a> %e A007960 Contains k=1, k=10, k=100, etc. derived from T=1. %e A007960 Contains k=3, k=30, k=300, etc. derived from T=3. %e A007960 Contains k=15, k=51, k=105, k=150, etc. derived from T=15. %p A007960 q:= n-> ormap(issqr, map(x-> 1+8*parse(cat(x[])), %p A007960 combinat[permute](convert(n, base, 10)))): %p A007960 select(q, [$1..500])[]; # _Alois P. Heinz_, Aug 22 2021 %t A007960 Select[Range[500], Length[Select[FromDigits/@Permutations[ IntegerDigits[#]], IntegerQ[(Sqrt[1+8#]-1)/2]&]]>0&] (* _Marco RipĂ _, Nov 07 2022 *) %Y A007960 Cf. A000217. %K A007960 nonn,base %O A007960 1,2 %A A007960 R. Muller %E A007960 A large number of errors corrected by _N. J. A. Sloane_, Apr 15 1996 %E A007960 Edited, corrected and extended by _R. J. Mathar_, Jan 08 2008