|
%I #18 Dec 22 2015 16:02:29
%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
%N Numbers n such that A003313(3n) < A003313(n).
%C The first 82 terms are identical to those of A116461 [A003313(6n) = A003313(n)]. The first difference occurs for a(83)=699051. 699051 is not in A116461, because A003313(699051)=24, A003313(3*699051)=22 and A003313(6*699051)=23. - _Hugo Pfoertner_, Dec 19 2015
%H Hugo Pfoertner, <a href="/A104699/b104699.txt">Table of n, a(n) for n = 1..10000</a>
%H Daniel Bleichenbacher, <a href="http://www.bell-labs.com/user/bleichen/diss/thesis.html">Efficiency and Security of Cryptosystems based on Number Theory.</a> PhD Thesis, Diss. ETH No. 11404, Zürich 1996. See p. 61.
%Y Cf. A003313, A116461.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, May 23 2008
%E Missing term a(21)=109227 from _Hugo Pfoertner_, Dec 19 2015
|
