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!)
A258432 Smallest number m such that A062234(m) = A062234(m-1+k) for k = 1..A258383(n). 9
1, 3, 5, 7, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 71, 72, 73, 74, 75, 76, 77 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
. n | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
. A062234 | 1 1 3 3 9 9 15 15 17 27 25 33 39 39 41
. --------+-----+-----+-----+-------+----+----+----+----+-------+----+-
. A258383 | 2 | 2 | 2 | 2 | 1 | 1 | 1 | 1 | 2 | 1 |
. A258432 | 1 | 3 | 5 | 7 | 9 | 10 | 11 | 12 | 13 | 15 |
. run # | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
PROG
(Haskell)
import Data.List (groupBy); import Data.Function (on))
a258432 n = a258432_list !! (n-1)
a258432_list = map (snd . head) $
groupBy ((==) `on` fst) $ zip a062234_list [1..]
CROSSREFS
Sequence in context: A007957 A194377 A344449 * A344000 A128938 A215138
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 31 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 March 29 04:59 EDT 2024. Contains 371264 sequences. (Running on oeis4.)