OFFSET
1,1
COMMENTS
It is also interestng to look at this sequence modulo 727.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
FORMULA
A101403(a(n)) = 5.
EXAMPLE
MATHEMATICA
A101402[0] = 0; A101402[1] = 1; A101402[n_] := A101402[n] = A101402[2^(Floor[Log[2, n - 1]])] + A101402[n - 1 - 2^(Floor[Log[2, n - 1]])]; TheList = Table[A101402[i], {i, 0, 203000}]; TheList2 = Union[TheList]; A101403 = Table[Count[TheList, i], {i, 0, Last[TheList]}]; TheSeq = Delete[Union[Table[ If[TheList[[i]] == TheList[[i + 4]], TheList[[i]]], {i, 1, Length[TheList] - 4}]], -1] Count[A101403, 5] Length[TheSeq]
PROG
(Haskell)
import Data.List (elemIndices)
a129117 n = a129117_list !! (n-1)
a129117_list = elemIndices 5 a101403M_list
-- Reinhard Zumkeller, Aug 28 2014
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Keith Schneider (schneidk(AT)email.unc.edu), May 25 2007
STATUS
approved