[go: nahoru, domu]

login
a(n) is the least k such that A122953(k) = n.
2

%I #20 Mar 10 2018 12:08:26

%S 1,2,4,6,11,12,22,24,28,44,52,56,88,92,112,116,186,184,220,232,244,

%T 368,376,440,472,488,744,752,880,888,976,984,1504,1512,1780,1776,1912,

%U 1968,2008,3024,3048,3552,3568,3824,3952,4016,6064,6096,7112,7136,7648,7664

%N a(n) is the least k such that A122953(k) = n.

%C All positive terms of A112510 belong to this sequence.

%C The first known odd terms are a(1) = 1, a(5) = 11 and a(77) = 61321.

%C The sequence is not strictly increasing; for example a(17) = 186 and a(18) = 184.

%C The binary plot of the first terms has interesting features (see Links section).

%H Rémy Sigrist, <a href="/A292924/b292924.txt">Table of n, a(n) for n = 1..288</a>

%H Rémy Sigrist, <a href="/A292924/a292924.png">Binary plot of the first 288 terms</a>

%H Rémy Sigrist, <a href="/A292924/a292924.txt">C++ program for A292924</a>

%e The first occurrence of 6 in A122953 is A122953(12) = 6, hence a(6) = 12.

%o (C++) See Links section.

%Y Cf. A112510, A122953.

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Mar 09 2018