
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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


LINKS



FORMULA

a(n) = 0 for all integer n.


MAPLE



MATHEMATICA

a[ n_] := 0;
LinearRecurrence[{1}, {0}, 102] (* Ray Chandler, Jul 15 2015 *)


PROG

(Magma) [ 0 : n in [0..100]];
(PARI) vector(100, n, 0)
(R) rep(0, 100)
(Haskell)
a000004 = const 0


CROSSREFS

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


KEYWORD

core,easy,nonn,mult


AUTHOR



STATUS

approved

