|
Search: id:A005376
|
|
|
| A005376 |
|
a(n)=n-a(a(a(a(a(n-1))))).
(Formerly M0464)
|
|
+0
2
|
|
| 0, 1, 1, 2, 3, 4, 5, 6, 6, 7, 7, 8, 9, 9, 10, 11, 12, 12, 13, 14, 15, 16, 16, 17, 18, 19, 20, 21, 21, 22, 23, 24, 25, 26, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 33, 34, 35, 35, 36, 37, 38, 39, 40, 40, 41, 41, 42, 43, 43, 44, 45, 46, 46, 47, 48, 49, 50, 51, 51, 52, 52, 53, 54, 54
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Conjecture: a(n) is approximately c*n, where c is the real root of x^5+x-1 = 0, c=0.754877666246692760049508896... - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 05 2002
Rule of construction for the sequence: a(n) = An, where An denotes the Lam{\'}e antecessor to (or right shift of) n, which is found by replacing each Lm(i) (Lm(n) = Lm(n-1) + Lm(n-5): A003520 ) in the Zeckendorffian expansion (obtained by repeatedly subtracting the largest Lam{\'}e number you can until nothing remains) by Lm(i-1) (A1=1). For example: 58 = 45 + 11 + 2, so a(58)= 34 + 8 + 1 = 43. - Diego Torres (torresvillarroel(AT)hotmail.com), Nov 24 2002
|
|
REFERENCES
|
Hofstadter, "Goedel, Escher, Bach", p. 137.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Index entries for Hofstadter-type sequences
Index entries for sequences from "Goedel, Escher, Bach"
Nick Hobson, Python program for this sequence
|
|
MAPLE
|
H:=proc(n) option remember; if n=1 then 1 else n-H(H(H(H(H(n-1))))); fi; end proc;
|
|
CROSSREFS
|
Sequence in context: A121856 A132172 A080680 this_sequence A086419 A025548 A121604
Adjacent sequences: A005373 A005374 A005375 this_sequence A005377 A005378 A005379
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 12 2000
|
|
|
Search completed in 0.002 seconds
|
