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!)
A256283 Smallest m such that A257905(m) = n. 3
1, 2, 4, 3, 7, 5, 9, 11, 14, 8, 13, 6, 17, 10, 19, 12, 21, 15, 23, 25, 27, 29, 31, 33, 38, 18, 36, 43, 41, 20, 35, 45, 47, 22, 51, 16, 53, 24, 49, 26, 40, 28, 50, 30, 57, 32, 59, 34, 55, 39, 65, 61, 63, 37, 67, 44, 71, 42, 75, 69, 77, 73, 79, 46, 81, 48, 85 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Conjectured inverse of A257905.
LINKS
MATHEMATICA
{a, f} = {{1}, {0}}; Do[tmp = {#, # - Last[a]} &[Min[Complement[#, Intersection[a, #]]&[Last[a] + Complement[#, Intersection[f, #]] &[Range[2 - Last[a], -1]]]]];
If[! IntegerQ[tmp[[1]]], tmp = {Last[a] + #, #} &[NestWhile[# + 1 &, 1, ! (! MemberQ[f, #] && ! MemberQ[a, Last[a] - #]) &]]];
AppendTo[a, tmp[[1]]]; AppendTo[f, tmp[[2]]], {1000}]; a;
Flatten[Table[Position[a, n], {n, 1, 150}]]) (* Peter J. C. Moses, May 14 2015 *)
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a256283 = (+ 1) . fromJust . (`elemIndex` a257905_list)
CROSSREFS
Cf. A257905.
Sequence in context: A346298 A084385 A073885 * A257465 A120234 A249571
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jun 03 2015
STATUS
approved

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 April 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)