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.

A202014 Smallest m such that A063882(m) = n.

This page as a plain text file.
%I A202014 #8 Jul 13 2013 12:04:19
%S A202014 1,5,6,7,8,10,12,13,15,17,18,21,23,24,26,28,29,32,34,35,37,39,42,44,
%T A202014 45,47,49,51,52,55,57,58,60,62,65,67,68,70,72,74,75,78,80,82,85,87,88,
%U A202014 90,92,94,95,98,100,102,103,105,107,109,112,114,115,117,119
%N A202014 Smallest m such that A063882(m) = n.
%C A202014 A063882(a(n)) = n and A063882(m) < n for m < a(n).
%H A202014 Reinhard Zumkeller, <a href="/A202014/b202014.txt">Table of n, a(n) for n = 1..10000</a>
%o A202014 (Haskell)
%o A202014 import Data.List (elemIndex)
%o A202014 import Data.Maybe (fromJust)
%o A202014 a202014 n = (fromJust $ elemIndex n a063882_list) + 1
%K A202014 nonn
%O A202014 1,2
%A A202014 _Reinhard Zumkeller_, Dec 08 2011