Search: id:A001468 Results 1-1 of 1 results found. %I A001468 M0099 N0036 %S A001468 1,2,1,2,2,1,2,1,2,2,1,2,2,1,2,1,2,2,1,2,1,2,2,1,2,2,1,2,1,2,2, %T A001468 1,2,2,1,2,1,2,2,1,2,1,2,2,1,2,2,1,2,1,2,2,1,2,1,2,2,1,2,2,1,2, %U A001468 1,2,2,1,2,2,1,2,1,2,2,1,2,1,2,2,1,2,2,1,2,1,2,2,1,2,2,1,2,1,2 %N A001468 There are a(n) 2's between successive 1's. %C A001468 Another version of the infinite Fibonacci word. See A003849 for the standard form. %C A001468 Start with 1, apply 1->12, 2->122, take limit . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 23 2005 %D A001468 M. Bunder and K. Tognetti, On the self matching properties of [j tau], Discrete Math., 241 (2001), 139-151. %D A001468 D. Gault and M. Clint, "Curiouser and curiouser" said Alice. Further reflections on an interesting recursive function, Internat. J. Computer Math., 26 (1988), 35-43. %D A001468 D. R. Hofstadter, personal communication. %D A001468 Problem E1226, Amer. Math. Monthly, 64 (1957), 197-198. %D A001468 Problem 4247, Amer. Math. Monthly, 55 (1948), 588-592. %D A001468 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001468 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %F A001468 [(n+1) tau] - [n tau], tau =(1 + sqrt 5)/2 = A001622, [] = floor function. %p A001468 Digits := 50: t := evalf( (1+sqrt(5))/2); A001468 := n->floor((n+1)*t)-floor(n*t); %t A001468 Table[Floor[GoldenRatio*(n + 1)] - Floor[GoldenRatio*n], {n, 0, 80}] - Joseph Biberstine (jrbibers(AT)indiana.edu), Aug 14 2006 %Y A001468 Same as A014675 if initial 1 is deleted. Cf. A003849. %Y A001468 Sequence in context: A025143 A080634 A109925 this_sequence A014675 A107362 A166332 %Y A001468 Adjacent sequences: A001465 A001466 A001467 this_sequence A001469 A001470 A001471 %K A001468 nonn,easy,nice %O A001468 0,2 %A A001468 N. J. A. Sloane (njas(AT)research.att.com). Rechecked Nov 07, 2001 Search completed in 0.001 seconds