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.

A050197 a(n) = least k satisfying a(k) = n in A050196.

This page as a plain text file.
%I A050197 #9 Mar 02 2016 21:39:03
%S A050197 1,3,4,7,5,9,19,6,11,16,21,8,13,49,18,23,41,10,46,15,51,20,56,25,43,
%T A050197 61,12,48,66,17,53,71,22,40,58,27,94,45,63,14,130,50,68,117,37,135,55,
%U A050197 73,24,91,42,60,109,29,127,96,47,65,114,83,34
%N A050197 a(n) = least k satisfying a(k) = n in A050196.
%H A050197 Ivan Neretin, <a href="/A050197/b050197.txt">Table of n, a(n) for n = 1..5000</a>
%Y A050197 Cf. A050196.
%K A050197 nonn
%O A050197 1,2
%A A050197 _Clark Kimberling_