A334219 a(n) is the number of terms beyond the starting value n before a repeated number first appears when following the same rules as Recamán's sequence A005132 but starting at n instead of 0.
24, 13, 21, 3, 3, 3, 15, 6, 6, 6, 15, 12, 9, 9, 9, 16, 20, 15, 12, 12, 12, 8, 10, 12, 20, 15, 15, 15, 10, 15, 24, 22, 26, 18, 18, 18, 11, 13, 18, 29, 28, 27, 21, 21, 21, 15, 13, 19, 17, 25, 31, 23, 24, 24, 24, 16, 18, 20, 21, 44, 28, 34, 34, 27, 27, 27, 17, 19, 27, 25, 24
Offset: 0
Keywords
Examples
a(0) = 24 as a(0) corresponds to the standard Recamán's sequence A005132 in which the term 42 appears at A005132(20) and then again at A005132(24), taking twenty-four terms before the first repeated number appears. a(4) = 3 as starting from 4 the sequence of visited numbers is 4,3,1,4 and it takes three steps beyond the start value for the first repeated number 4 to appear. a(6) = 15 as starting from 6 the sequence of visited numbers is 6,5,3,0,4,9,15,8,16,7,17,28,40,27,13,28 and it takes fifteen steps beyond the start value for the first repeated number 28 to appear.
Links
- Scott R. Shannon, Table of n, a(n) for n = 0..10000
- Scott R. Shannon, Plot of the terms for n = 0 to 1000000
- Index entries for sequences related to Recamán's sequence
Comments