login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226483 Smallest m such that A224909(m) = n. 2

%I #6 Jan 26 2014 13:44:53

%S 3,1,6,7,53,32,11,36,99,13,42,15,38,291,71,56,79,28,68,70,31,54,235,

%T 41,164,33,277,64,35,67,86,227,124,72,81,161,191,85,83,163,57,59,84,

%U 196,330,61,159,69,94,295,465,228,76,439,186,126,121,194,198,168

%N Smallest m such that A224909(m) = n.

%C A224909(a(n)) = n and A224909(m) <> n for m < a(n).

%H Reinhard Zumkeller, <a href="/A226483/b226483.txt">Table of n, a(n) for n = 0..10000</a>

%o (Haskell)

%o a226483 = (+ 1) . fromJust . (`elemIndex` a224909_list)

%K nonn,look

%O 0,1

%A _Reinhard Zumkeller_, Jun 09 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 05:16 EDT 2024. Contains 371264 sequences. (Running on oeis4.)