|
%I M0000 #128 Jan 13 2023 09:26:26
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N The zero sequence.
%H N. J. A. Sloane, <a href="/A000004/b000004.txt">Table of n, a(n) for n = 0..1000</a> [Useful when <a href="/plot2.html">plotting one sequence against another</a>.]
%H Luis Manuel Rivera, <a href="http://arxiv.org/abs/1406.3081">Integer sequences and k-commuting permutations</a>, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
%H N. J. A. Sloane, <a href="https://arxiv.org/abs/2301.03149">"A Handbook of Integer Sequences" Fifty Years Later</a>, arXiv:2301.03149 [math.NT], 2023, p. 10.
%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
%H <a href="/index/Cor#core">Index entries for "core" sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%H <a href="/index/Fi#FIXEDPOINTS">Index entries for sequences that are fixed points of mappings</a>
%F a(n) = 0 for all integer n.
%p A000004 := n->0;
%t a[ n_] := 0;
%t Table[0, {n, 100}] (* _Matthew House_, Jul 14 2015 *)
%t LinearRecurrence[{1},{0},102] (* _Ray Chandler_, Jul 15 2015 *)
%o (Magma) [ 0 : n in [0..100]];
%o (PARI) vector(100,n,0)
%o (R) rep(0,100)
%o (Haskell)
%o a000004 = const 0
%o a000004_list = repeat 0 -- _Reinhard Zumkeller_, May 07 2012
%o (Python) print([0 for n in range(102)]) # _Michael S. Branicky_, Apr 04 2022
%Y Cf. A000012 (all 1's), A007395 (all 2's), A010701 (all 3's).
%Y Cf. A000007(n) = 0^n: characteristic function of {0}.
%K core,easy,nonn,mult
%O 0,1
%A _N. J. A. Sloane_
|
