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.

A199262 Smallest m such that A199238(m) = n.

This page as a plain text file.
%I A199262 #13 Mar 30 2012 18:51:11
%S A199262 1,3,11,15,59,95,223,255,1007,1919,4091,6143,16379,28671,61439,65535,
%T A199262 261119,516095,1048571,1966079,4128767,8380415,16769023,25165823,
%U A199262 67108799,134184959,268434431,469762047,1073741819,2013265919,4160749567,4294967295,17163091967
%N A199262 Smallest m such that A199238(m) = n.
%C A199262 A199238(a(n)) = n and A199238(m) <> n for m < a(n).
%o A199262 (Haskell)
%o A199262 a199262 n = (fromJust $ elemIndex n a199238_list) + 1
%Y A199262 Cf. A138791.
%K A199262 nonn
%O A199262 0,2
%A A199262 _Reinhard Zumkeller_, Nov 04 2011
%E A199262 a(24)-a(32) from _Donovan Johnson_, Nov 05 2011