cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A330589 The n-th index m such that A330439(m) = n.

This page as a plain text file.
%I A330589 #16 Dec 18 2019 22:00:43
%S A330589 0,7,12,29,59,72,85,142,190,205,238,270,305,318,402,492,619,652,795,
%T A330589 845,950,996,1121,1163,1228,1393,1548,1662,1756,1920,1937,2106,2202,
%U A330589 2351,2448,2555,2594,2707,2788,3254,3420,3466,3663,3974,4136,4282,4363,4621,4732
%N A330589 The n-th index m such that A330439(m) = n.
%H A330589 Alois P. Heinz, <a href="/A330589/b330589.txt">Table of n, a(n) for n = 1..10000</a>
%F A330589 a(n) = A330587(n,n).
%p A330589 b:= proc() 0 end:
%p A330589 g:= proc(n) option remember; local t;
%p A330589       t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
%p A330589       b(t):= b(t)+1; t
%p A330589     end:
%p A330589 f:= proc(n) option remember; b(g(n)) end:
%p A330589 a:= proc() local a, b, t; a, b, t:= proc() end, proc() 0 end, -1;
%p A330589       proc(k) local h;
%p A330589         while b(k)<k do t:= t+1; h:= f(t);
%p A330589           b(h):= b(h)+1; if b(h)=h then a(h):= t fi
%p A330589         od: a(k)
%p A330589       end
%p A330589     end():
%p A330589 seq(a(n), n=1..50);
%Y A330589 Main diagonal of A330587.
%Y A330589 Cf. A316774, A330439.
%K A330589 nonn
%O A330589 1,2
%A A330589 _Alois P. Heinz_, Dec 18 2019