%I #32 Sep 11 2024 10:06:43
%S 2731,5462,10923,10924,13655,21846,21848,27307,27310,43691,43692,
%T 43696,54614,54615,54620,71003,87382,87384,87392,92843,109227,109228,
%U 109230,109240,133819,142006,152919,174763,174764,174768,174784,177515,185686
%N Numbers k such that A003313(k) = A003313(6*k).
%C The first 20 terms are identical to those given in Table 4.5, "The set of values m satisfying l(3m)<l(m)" on page 61 of Daniel Bleichenbachers PhD Thesis (see A104699). Only 109227 is not in Table 4.5.
%C The first 82 terms are identical to those of A104699, but A104699(83)=699051, for which A003313(3*699051)=22, is not in the current sequence, because A003313(6*699051)=23 < A003313(699051)=24. - _Hugo Pfoertner_, Dec 19 2015
%H Hugo Pfoertner, <a href="/A116461/b116461.txt">Table of n, a(n) for n = 1..10000</a>
%H Daniel Bleichenbacher, <a href="https://web.archive.org/web/20070912030837/http://www.bell-labs.com/user/bleichen/diss/diss.ps">Efficiency and Security of Cryptosystems based on Number Theory.</a> PhD Thesis, Diss. ETH No. 11404, Zürich 1996. See p. 61.
%Y Cf. A115016, A003313 [l(k)], A086878 [l(k)=l(2*k)], A116459 [l(k)=l(3*k)], A261986 [l(k)=l(4*k)], A116460 [l(k)=l(5*k)], A116462 [l(k)=l(7*k)], A116463 [l(k)=l(9*k)], A117151 [l(k)=l(10*k)].
%Y Cf. A104699.
%K nonn
%O 1,1
%A _Hugo Pfoertner_, Mar 07 2006