This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A169609 #40 Aug 29 2024 17:50:39 %S A169609 1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1, %T A169609 3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3, %U A169609 3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3 %N A169609 Period 3: repeat [1, 3, 3]. %C A169609 Interleaving of A000012, A010701 and A010701. %C A169609 Also continued fraction expansion of (5+sqrt(65))/10 = 1.3062257748.... %C A169609 Also decimal expansion of 133/999. %C A169609 a(n) = A144437(n) for n > 0. %C A169609 Unsigned version of A154595. %C A169609 Binomial transform of A168615. %C A169609 Inverse binomial transform of A168673. %C A169609 Essentially first differences of A047347. %H A169609 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1). %F A169609 a(n) = a(n-3) for n > 2, with a(0) = 1, a(1) = 3, a(2) = 3. %F A169609 G.f.: (1+3*x+3*x^2)/(1-x^3). %F A169609 a(n) = (7/3)+(2/3)*cos((2*Pi/3)*(n+1))-(2*sqrt(3)/3)*sin((2*Pi/3)*(n+1)). [_Richard Choulet_, Mar 15 2010] %F A169609 a(n) = a(n-a(n-2)) for n>=2. Example: a(5) = a(5-a(3)) = a(5-a(3-a(1))) = a(5-a(3-3)) = a(5-a(0)) = a(5-1) = a(4) = a(4-a(2)) = a(4-3) = a(1) = 3. [_Richard Choulet_, Mar 15 2010; edited by _Klaus Brockhaus_, Nov 21 2010] %F A169609 a(n) = 1 + 2*sgn(n mod 3). - _Wesley Ivan Hurt_, Jul 02 2016 %F A169609 a(n) = 3/gcd(n,3). - _Wesley Ivan Hurt_, Jul 11 2016 %p A169609 seq(op([1, 3, 3]), n=0..50); # _Wesley Ivan Hurt_, Jul 02 2016 %t A169609 PadRight[{},120,{1,3,3}] (* or *) LinearRecurrence[{0,0,1},{1,3,3},120] (* _Harvey P. Dale_, Apr 29 2015 *) %o A169609 (Magma) [ n mod 3 eq 0 select 1 else 3: n in [0..104] ]; %o A169609 (Magma) &cat [[1, 3, 3]^^30]; // _Wesley Ivan Hurt_, Jul 02 2016 %Y A169609 Cf. A000012 (all 1's sequence), A010701 (all 3's sequence), A144437 (repeat 3, 3, 1), A154595 (repeat 1, 3, 3, -1, -3, -3), A168615, A168673, A047347 (congruent to {0, 1, 4} mod 7), A010684 (repeat 1, 3). %Y A169609 Cf. A171419 (decimal expansion of (5+sqrt(65))/10). %Y A169609 Cf. A146094. %K A169609 easy,cofr,cons,nonn %O A169609 0,2 %A A169609 _Klaus Brockhaus_, Dec 03 2009 %E A169609 Keywords cofr, cons added by _Klaus Brockhaus_, Apr 20 2010 %E A169609 Minor edits, crossref added by _Klaus Brockhaus_, May 03 2010