a(n) is the conjectured largest number such that both a(n) and a(n) - n are 11-smooth numbers, or 0 if no such number exists. a(n) can be less than n.

A392256

a(n) is the conjectured largest number such that both a(n) and a(n) - n are 11-smooth numbers, or 0 if no such number exists. a(n) can be less than n.

Terms

    a(0) =9801a(1) =19602a(2) =29403a(3) =39204a(4) =49005a(5) =58806a(6) =68607a(7) =78408a(8) =88209a(9) =98010a(10) =107811a(11) =117612a(12) =151263a(13) =137214a(14) =147015a(15) =156816a(16) =5120a(17) =176418a(18) =43923a(19) =196020a(20) =205821a(21) =215622a(22) =3773a(23) =235224a(24) =245025a(25) =302526a(26) =264627a(27) =274428a(28) =19712a(29) =294030

External references