|
|
A087686
|
|
Elements of A004001 that repeat consecutively.
|
|
28
|
|
|
1, 2, 4, 7, 8, 12, 14, 15, 16, 21, 24, 26, 27, 29, 30, 31, 32, 38, 42, 45, 47, 48, 51, 53, 54, 56, 57, 58, 60, 61, 62, 63, 64, 71, 76, 80, 83, 85, 86, 90, 93, 95, 96, 99, 101, 102, 104, 105, 106, 109, 111, 112, 114, 115, 116, 118, 119, 120, 121, 123, 124, 125, 126, 127
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
After 1, one more than the positions of zeros in A093879.
(End)
|
|
LINKS
|
|
|
FORMULA
|
Other identities. For all n >= 1:
|
|
MATHEMATICA
|
Conway[n_Integer?Positive] := Conway[n] =Conway[Conway[n-1]] + Conway[n - Conway[n-1]] Conway[1] = Conway[2] = 1 digits=1000 a=Table[Conway[n], {n, 1, digits}]; b=Table[If[a[[n]]-a[[n-1]]==0, a[[n]], 0], {n, 2, digits}]; c=Delete[Union[b], 1]
|
|
PROG
|
(Haskell)
import Data.List (findIndices)
a087686 n = a087686_list !! (n-1)
a087686_list = map succ $ findIndices (> 1) a051135_list
(Scheme, with Antti Karttunen's IntSeq-library)
|
|
CROSSREFS
|
Cf. A080677 (the least monotonic left inverse).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|