login
a(n) is the least k such that A335299(k) = n, or -1 if no such k exists.
2

%I #9 Jun 02 2020 14:10:02

%S 0,1,4,2,71,73,3,5,16,14,12,10,8,6,31,29,27,25,23,438,7,9,11,13,15,17,

%T 59,57,520,410,56,54,52,50,48,46,44,42,40,38,692,22,20,18,28,30,32,97,

%U 424,234,96,94,92,90,88,86,240,4518,296,294,464,462,19,21

%N a(n) is the least k such that A335299(k) = n, or -1 if no such k exists.

%H Rémy Sigrist, <a href="/A335300/b335300.txt">Table of n, a(n) for n = 0..10000</a>

%H Rémy Sigrist, <a href="/A335300/a335300.png">Logarithmic scatterplot of the sequence for n = 0..1000000</a>

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

%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>

%o (C++) See Links section.

%Y Cf. A005132, A057167, A335299.

%K nonn

%O 0,3

%A _Rémy Sigrist_, May 31 2020