%I #33 Jul 26 2022 01:35:09
%S 0,1,5,25,625,9376,90625,890625,7109376,12890625,212890625,1787109376,
%T 81787109376,59918212890625,259918212890625,3740081787109376,
%U 56259918212890625,256259918212890625,7743740081787109376
%N Numbers m such that m-th triangular number (A000217) ends in m.
%C Thanks to David W. Wilson for the proof that this sequence is a proper subset of A003226.
%C Also, numbers m such that the m-th k-gonal number ends in m for k == 1, 3, 5, or 9 (mod 10). - _Robert Dawson_, Jul 09 2018
%C This sequence is the intersection of A093534 and A301912. - _Robert Dawson_, Aug 01 2018
%H Chai Wah Wu, <a href="/A067270/b067270.txt">Table of n, a(n) for n = 1..888</a>
%H Robert Dawson, <a href="https://www.emis.de/journals/JIS/VOL21/Dawson/dawson6.html">On Some Sequences Related to Sums of Powers</a>, J. Int. Seq., Vol. 21 (2018), Article 18.7.6.
%e The 5th triangular = 15 ends in 5, hence 5 is a term of the sequence.
%t (* a5=A018247 less the commas; a6=A018248 less the commas; *)
%t b5 = FromDigits[ Reverse[ IntegerDigits[a5]]]; b6 = FromDigits[ Reverse[ IntegerDigits[a6]]]; f[0] = 1; f[n_] := Block[{c5 = Mod[b5, 10^n], c6 = Mod[b6, 10^n]}, If[ Mod[c5(c5 + 1)/2, 10^n] == c5, c5, c6]]; Union[ Table[ f[n], {n, 0, 20}]]
%o (Python)
%o from itertools import count, islice
%o from sympy.ntheory.modular import crt
%o def A067270_gen(): # generator of terms
%o a = 0
%o yield from (0,1)
%o for n in count(0):
%o if (b := int(min(crt(m:=(1<<(n+1),5**n),(0,1))[0], crt(m,(1,0))[0]))) > a:
%o yield b
%o a = b
%o A067270_list = list(islice(A067270_gen(),15)) # _Chai Wah Wu_, Jul 25 2022
%Y Proper subset of A003226. Cf. A007185, A018247, A016090, A018248.
%Y Intersection of A093534 and A301912.
%K base,nonn
%O 1,3
%A _Joseph L. Pe_, Feb 21 2002
%E Edited and extended by _Robert G. Wilson v_, Nov 20 2002
%E 0 prepended by _David A. Corneth_, Aug 02 2018