|
%I #23 Jan 25 2016 03:30:38
%S 1,2,3,4,6,8,9,11,18,20,24,26,30,33,38,42,44,56,58,64,66,80,92,100,
%T 102,120,122,134,141,154,166,168,198,200,212,224,258,260,274,276,308,
%U 318,344,380,382,392,394,417,447,466,486,488,494,537,568,588,604,633,654,702,704,731,760,812,814,870,872,904,932,963,994,1026
%N a(n) = point where A260643 for the first time obtains value n.
%C Also positions of records in A260643.
%H Peter Kagey, <a href="/A265414/b265414.txt">Table of n, a(n) for n = 1..2920</a> (all terms under 1,000,000)
%H Antti Karttunen, <a href="/A260643/a260643.txt">R6RS-Scheme program for computing this sequence</a> (slowly)
%F Other identities. For all n >= 1:
%F A260643(a(n)) = n. [The sequence gives the first position where n occurs in A260643.]
%Y Cf. A260643, A265415.
%K nonn
%O 1,2
%A _Antti Karttunen_, Dec 09 2015
|
