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.

A227954 Smallest m such that A070965(m) = -n.

This page as a plain text file.
%I A227954 #7 Jan 25 2022 12:25:10
%S A227954 3,15,78,115,155,310,231,911,619,691,464,863,1294,1616,3240,2235,1240,
%T A227954 2240,3472,3183,4479,2766,4148,9212,6588,4567,2587,2588,4846,6479,
%U A227954 3231,7763,3744,3743,2479,2480,6367,7440,12936,2768,9914,9395,13415,11059,9792
%N A227954 Smallest m such that A070965(m) = -n.
%F A227954 A070965(a(n)) = -n and A070965(m) <> -n for m < a(n);
%F A227954 A070965(A227953(n)) = n.
%o A227954 (Haskell)
%o A227954 import Data.List (elemIndex); import Data.Maybe (fromJust)
%o A227954 a227954 = (+ 1) . fromJust . (`elemIndex` a070965_list) . negate
%Y A227954 Cf. A070965, A227953.
%K A227954 nonn
%O A227954 0,1
%A A227954 _Reinhard Zumkeller_, Aug 01 2013