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.

A227953 Smallest m such that A070965(m) = n.

This page as a plain text file.
%I A227953 #9 Jan 25 2022 12:24:52
%S A227953 3,1,30,63,187,232,348,375,912,620,692,463,864,2303,1615,2806,4844,
%T A227953 1239,2239,1383,1835,2236,3716,6575,3447,3670,1384,6894,13422,7486,
%U A227953 9131,6462,6480,13703,13039,4958,9908,6368,9912,5534,2767,12734,9719,16598,11060
%N A227953 Smallest m such that A070965(m) = n.
%F A227953 A070965(a(n)) = n and A070965(m) <> n for m < a(n).
%F A227953 A070965(A227954(n)) = -n.
%o A227953 (Haskell)
%o A227953 import Data.List (elemIndex); import Data.Maybe (fromJust)
%o A227953 a227953 = (+ 1) . fromJust . (`elemIndex` a070965_list)
%Y A227953 Cf. A070965, A227954.
%K A227953 nonn
%O A227953 0,1
%A A227953 _Reinhard Zumkeller_, Aug 01 2013