|
Search: id:A101210
|
|
|
| A101210 |
|
Charlie Chaplin numbers: Stage 1: the input is the sequence F(n) = 1,2,1,2,1,2,1,2,... of alternating 1's and 2s, starting with F(1)=1. Let m = 1. At each iteration take F(m) and add it to F(m+F(m)) then increment m by 1 and repeat. The numbers are the values of F(m) which are larger than all previous values. |
|
+0
2
|
|
| 1, 3, 4, 5, 8, 11, 12, 13, 14, 15, 16, 17, 23, 33, 37, 39, 68, 73, 76, 79, 85, 90, 97, 117, 157, 160, 180, 252, 253, 368, 376, 378, 381, 421, 429, 534, 644, 652, 657, 742, 743, 746, 839, 890, 1026, 1329, 1344, 1345, 1523, 1526, 1545, 1546, 1547, 1550, 1562
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Charlie Chaplin numbers are inspired by his comedy routine working on a conveyor belt. Which input functions give chotic outputs? How does the output sequence grow?
Comment from David Wasserman (dwasserm(AT)earthlink.net), Mar 11 2008: The sequence gives the record values of the system output. The record values that occur while computing the system output are given in A116587.
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 1..79
|
|
MAPLE
|
A101210 := proc(nmax) local F, m, Fnew, Fnewidx, a ; F := [seq(2- (i mod 2), i=1..nmax)] ; m := 1: while m <= nops(F) do if m+op(m, F) <= nops(F) then Fnew := op(m, F)+op(m+op(m, F), F) ; Fnewidx := m+op(m, F) ; F := subsop(Fnewidx=Fnew, F) ; fi ; m := m+1 ; od: a := [1] ; for m from 2 to nops(F) do if op(m, F) > op(-1, a) then a := [op(a), op(m, F)] ; fi ; od: a ; end: A101210(40000) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 12 2008
|
|
CROSSREFS
|
Cf. A101210.
Sequence in context: A079136 A103329 A080726 this_sequence A047599 A050846 A035538
Adjacent sequences: A101207 A101208 A101209 this_sequence A101211 A101212 A101213
|
|
KEYWORD
|
easy,nonn,uned,obsc
|
|
AUTHOR
|
Gordon Robert Hamilton (hamiltonian(AT)shaw.ca), Dec 14 2004
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Mar 11 2008
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 12 2008
|
|
|
Search completed in 0.002 seconds
|
