cp's OEIS Frontend

A258432 Smallest number m such that A062234(m) = A062234(m-1+k) for k = 1..A258383(n).

%I A258432 #4 May 31 2015 05:14:01
%S A258432 1,3,5,7,9,10,11,12,13,15,16,17,18,19,20,21,22,23,24,25,26,28,30,31,
%T A258432 32,33,34,35,36,37,38,39,40,41,42,43,45,46,47,48,49,51,52,53,54,55,56,
%U A258432 57,58,59,60,61,62,63,64,66,67,68,69,71,72,73,74,75,76,77
%N A258432 Smallest number m such that A062234(m) = A062234(m-1+k) for k = 1..A258383(n).
%H A258432 Reinhard Zumkeller, <a href="/A258432/b258432.txt">Table of n, a(n) for n = 1..10000</a>
%e A258432 .       n | 1 2   3 4   5 6    7  8    9   10   11   12   13 14   15
%e A258432 . A062234 | 1 1   3 3   9 9   15 15   17   27   25   33   39 39   41
%e A258432 . --------+-----+-----+-----+-------+----+----+----+----+-------+----+-
%e A258432 . A258383 | 2   | 2   | 2   | 2     | 1  |  1 |  1 |  1 |  2    |  1 |
%e A258432 . A258432 | 1   | 3   | 5   | 7     | 9  | 10 | 11 | 12 | 13    | 15 |
%e A258432 . run #   | 1   | 2   | 3   | 4     | 5  |  6 |  7 |  8 |  9    | 10 |
%o A258432 (Haskell)
%o A258432 import Data.List (groupBy); import Data.Function (on))
%o A258432 a258432 n = a258432_list !! (n-1)
%o A258432 a258432_list = map (snd . head) $
%o A258432                     groupBy ((==) `on` fst) $ zip a062234_list [1..]
%Y A258432 Cf. A062234, A258383.
%K A258432 nonn
%O A258432 1,2
%A A258432 _Reinhard Zumkeller_, May 31 2015