A000004 The zero sequence.

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, 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, 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

Offset: 0

Author

N. J. A. Sloane

Keywords

• core
• easy
• nonn
• mult

Links

• N. J. A. Sloane, Table of n, a(n) for n = 0..1000 [Useful when plotting one sequence against another.]
• Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
• N. J. A. Sloane, "A Handbook of Integer Sequences" Fifty Years Later, arXiv:2301.03149 [math.NT], 2023, p. 10.
• Index entries for characteristic functions
• Index entries for "core" sequences
• Index entries for linear recurrences with constant coefficients, signature (1).
• Index entries for sequences that are fixed points of mappings

Crossrefs

Cf. A000012 (all 1's), A007395 (all 2's), A010701 (all 3's).

Cf. A000007(n) = 0^n: characteristic function of {0}.

Programs

Haskell

a000004 = const 0
a000004_list = repeat 0  -- Reinhard Zumkeller, May 07 2012

Magma

[ 0 : n in [0..100]];

Maple

A000004 := n->0;

Mathematica

a[ n_] := 0;
Table[0, {n, 100}] (* Matthew House, Jul 14 2015 *)
LinearRecurrence[{1},{0},102] (* Ray Chandler, Jul 15 2015 *)

PARI

vector(100,n,0)

Python

print([0 for n in range(102)]) # Michael S. Branicky, Apr 04 2022

R

rep(0,100)

Formula

a(n) = 0 for all integer n.