|
%I #37 Nov 14 2022 00:37:49
%S -1,-2,-3,-4,-5,-6,-7,-8,-9,-10,-11,-12,-13,-14,-15,-16,-17,-18,-19,
%T -20,-21,-22,-23,-24,-25,-26,-27,-28,-29,-30,-31,-32,-33,-34,-35,-36,
%U -37,-38,-39,-40,-41,-42,-43,-44,-45,-46,-47,-48,-49,-50,-51,-52,-53,-54,-55,-56,-57,-58,-59,-60,-61,-62,-63,-64,-65
%N The negative integers.
%H Felix Fröhlich, <a href="/A001478/b001478.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from David Wasserman)
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Cor#core">Index entries for "core" sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F a(n) = -n.
%F G.f.: -x/(1-x)^2.
%F G.f. A(x) satisfies A(x) + A(-x) = 4A(x^2), A(x)A(-x) = A(x^2), A(x)^2 + A(x^2) = 4A(x)A(x^2). - _Michael Somos_, Mar 23 2004
%F a(n) = -A000027(n). - _Felix Fröhlich_, Jul 23 2021
%p A001478 := n->-n;
%t Table[ -n, {n, 1, 50}] (* _Stefan Steinerberger_, Apr 01 2006 *)
%t Range[-1, -65, -1] (* _Alonso del Arte_, Oct 06 2013 *)
%o (PARI) a(n)=-n
%o (Python) def a(n): return -n # _Michael S. Branicky_, Nov 13 2022
%Y Cf. A001477 (complement in A001057), A000027, A001489, A130472.
%K core,sign,easy
%O 1,2
%A _N. J. A. Sloane_
|
