%I #22 Mar 22 2022 15:33:58

%S 26,52,148,280,320,454,1150,1480,8000,41650,80300,165656,166088,

%T 614900,2353700,2859460,28233200,66130400,68941640,85717240,107300320,

%U 131507080,155478800,207666520,1426680920,1824596800,2468014900,2475648820,5342351060,5355218900,5857281500,8550475900,36025361120

%N Common terms between A061078 and A061077.

%C Smarandache's conjecture: there are infinitely many terms.

%C This is a subsequence of A061076.

%D A. Murthy, Smarandache friendly numbers and a few more sequences, Smarandache Notions Journal, Vol. 12, No. 1-2-3, Spring 2001. Page 267

%H Chai Wah Wu, <a href="/A352346/b352346.txt">Table of n, a(n) for n = 1..205</a>

%e 26 is a term of this sequence, in fact:

%e 26 = 1+3+5+7+9+1*1 (A061077(6)=26);

%e 26 = 2+4+6+8+1*0+1*2+1*4 (A061078(7)=26).

%t Intersection[Accumulate[Times @@@ IntegerDigits[Range[2, 10000000, 2]]],

%t Accumulate[Times @@@ IntegerDigits[Range[1, 10000000, 2]]]]

%o (Python)

%o from math import prod

%o from itertools import islice

%o def A352346_gen(): # generator of terms

%o n1, m1, n2, m2 = 1, 1, 2, 2

%o while True:

%o if m1 == m2:

%o yield m1

%o k = 0

%o while k == 0:

%o n1 += 2

%o m1 += (k := prod(int(d) for d in str(n1)))

%o while m2 < m1:

%o n2 += 2

%o m2 += prod(int(d) for d in str(n2))

%o A352346_list = list(islice(A352346_gen(),20)) # _Chai Wah Wu_, Mar 21 2022

%Y Cf. A061076, A061077, A061078.

%K nonn,base

%O 1,1

%A _Luca Onnis_, Mar 12 2022