Search: id:A057167 Results 1-1 of 1 results found. %I A057167 %S A057167 1,4,2,131,129,3,5,16,14,12,10,8,6,31,29,27,25,23,99734,7,9,11,13, %T A057167 15,17,64,62,60,58,56,54,52,50,48,46,44,42,40,38,111,22,20,18,28,30, %U A057167 32,222,220,218,216,214,212,210,208,206,204,202,200,198,196 %N A057167 Term in Recaman's sequence A005132 where n appears for first time, or 0 if n never appears. %H A057167 T. D. Noe, Table of n, a(n) for n=1..1642 (taking a(1355) from A064227) %H A057167 Nick Hobson, Python program for this sequence %H A057167 C. L. Mallows, Plot (jpeg) of first 10000 terms of A005132 %H A057167 C. L. Mallows, Plot (postscript) of first 10000 terms of A005132 %H A057167 N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98). %H A057167 N. J. A. Sloane, FORTRAN program for A005132, A057167, A064227, A064228 %H A057167 Index entries for sequences related to Recaman's sequence %p A057167 w := array(1..10000); for j from 1 to 100 do l := 0; for k from 1 to nops(a) do if a[k] = j then l := k; exit; fi; od: w[j] := l; od: s := [seq(w[j],j=1..100)]; # where a is an array formed from sequence A005132 %Y A057167 Cf. A005132, A057165, A057166. %Y A057167 Sequence in context: A107667 A163176 A010319 this_sequence A096683 A158903 A152030 %Y A057167 Adjacent sequences: A057164 A057165 A057166 this_sequence A057168 A057169 A057170 %K A057167 nonn,easy,nice %O A057167 1,2 %A A057167 N. J. A. Sloane (njas(AT)research.att.com), Sep 14 2000 %E A057167 I conjecture a(n) is never 0 - but see A064227, A064228. Search completed in 0.002 seconds