|
%I #104 Mar 03 2023 08:07:20
%S 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%T 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U 3,3,3,3,3,3,3,3,3,3,3,3,3
%N Constant sequence: the all 3's sequence.
%C Decimal expansion of 1/3. - _Raymond Wang_, Mar 06 2010
%C Continued fraction expansion of (3+sqrt(13))/2. - _Bruno Berselli_, Mar 15 2011
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1011">Encyclopedia of Combinatorial Structures 1011</a>.
%H Daniele A. Gewurz and Francesca Merola, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Gewurz/gewurz5.html">Sequences realized as Parker vectors of oligomorphic permutation groups</a>, J. Integer Seqs., Vol. 6 (2003), Article 03.1.6.
%H Rick Mabry, <a href="https://www.maa.org/programs/faculty-and-departments/classroom-capsules-and-notes/proof-without-words-14-142-143-ldots-13">Proof without words: 1/4+(1/4)^2+(1/4)^3+...=1/3</a>, Math. Mag., Vol. 72, No. 1 (1999), p. 63.
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%F G.f.: 3/(1-x). - _Bruno Berselli_, Mar 15 2011
%F E.g.f.: 3*e^x. - _Vincenzo Librandi_, Jan 24 2012
%F a(n) = A040000(n) + A054977(n). - _Reinhard Zumkeller_, May 06 2012
%F a(n) = 3*A000012(n). - _Michel Marcus_, Dec 18 2015
%F a(n) = floor(1/(n - cot(1/n))). - _Clark Kimberling_, Mar 10 2020
%F Equals Sum_{k>=1} (1/4)^k (as a constant). - _Michel Marcus_, Jun 11 2020
%F Equals Sum_{k>=2} (k-1)/binomial(2*k,k) (as a constant). - _Amiram Eldar_, Jun 05 2021
%F Equals Sum_{k>=1} (-1)^(k+1)/2^k. - _Michal Paulovic_, Mar 02 2023
%e 1/3 = 0.33333333333333333333333333333333333333333333... - _Bruno Berselli_, Mar 21 2014
%p evalf(1/3, 100); # _Michal Paulovic_, Mar 02 2023
%t Table[3, {100}] (* _Wesley Ivan Hurt_, Jul 16 2014 *)
%o (Haskell)
%o a010701 = const 3
%o a010701_list = repeat 3 -- _Reinhard Zumkeller_, May 07 2012
%o (Maxima) makelist(3, n, 0, 30); /* _Martin Ettl_, Nov 09 2012 */
%o (PARI) a(n)=3 \\ _Felix Fröhlich_, Jul 16 2014
%o (Python)
%o def A010701(n): return 3 # _Chai Wah Wu_, Nov 10 2022
%Y Cf. A000012, A040000, A054977.
%K nonn,cons,easy
%O 0,1
%A _N. J. A. Sloane_
|
