OFFSET
1,1
COMMENTS
Out of the first one million terms (a(10^6) = 510403), 258661 occur only once.
From Antti Karttunen, Jan 18 2016: (Start)
In general, out of the first 2^(n+1) terms of A004001, 2^(n-1) - 1 terms (a quarter) occur only once. See also illustration in A265332.
One more than the positions of ones in A093879.
(End)
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
a[1] = 1; a[2] = 1; a[n_] := a[n] = a[ a[n - 1]] + a[n - a[n - 1]]; hc = Table[ a[n], {n, 1, 261}]; RunLengthEncodeOne[x_List] := Length[ # ] == 1 & /@ Split[x]; r = RunLengthEncodeOne[hc]; Select[ Range[ Length[r]], r[[ # ]] == True &]
PROG
(Haskell)
import Data.List (elemIndices)
a088359 n = a088359_list !! (n-1)
a088359_list = map succ $ elemIndices 1 a051135_list
-- Reinhard Zumkeller, Jun 03 2011
(Scheme, with Antti Karttunen's IntSeq-library)
;; Antti Karttunen, Jan 18 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Sep 26 2003
STATUS
approved