login
Coefficients in 1/(1+P(x)), where P(x) is the generating function of the primes.
21

%I #40 Feb 01 2021 18:58:26

%S 1,-2,1,-1,2,-3,7,-10,13,-21,26,-33,53,-80,127,-193,254,-355,527,-764,

%T 1149,-1699,2436,-3563,5133,-7352,10819,-15863,23162,-33887,48969,

%U -70936,103571,-150715,219844,-320973,466641,-679232,988627,-1437185,2094446,-3052743

%N Coefficients in 1/(1+P(x)), where P(x) is the generating function of the primes.

%C a(n+1)/a(n) => ~-1.456074948582689671... (see A072508). - _Zak Seidov_, Oct 01 2011

%H Seiichi Manyama, <a href="/A030018/b030018.txt">Table of n, a(n) for n = 0..6124</a> (terms 0..1000 from Zak Seidov)

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BackhousesConstant.html">Backhouse's Constant</a>

%F Apply inverse of "INVERT" transform to primes: INVERT: a's from b's in 1+Sum a_i x^i = 1/(1-Sum b_i x^i).

%F a(n) = -prime(n) - Sum_{i=1..n-1} prime(i)*a(n-i), for n > 0. - _Derek Orr_, Apr 28 2015

%F a(n) = Sum_{k=0..n} (-1)^k * A340991(n,k). - _Alois P. Heinz_, Feb 01 2021

%p a:= proc(n) option remember; `if`(n=0, 1,

%p -add(ithprime(n-i)*a(i), i=0..n-1))

%p end:

%p seq(a(n), n=0..70); # _Alois P. Heinz_, Jun 13 2018

%t max = 50; P[x_] := 1 + Sum[Prime[n]*x^n, {n, 1, max}]; s = Series[1/P[x], {x, 0, max}]; CoefficientList[s, x] (* _Jean-François Alcover_, Sep 24 2014 *)

%o (PARI) v=[];for(n=1,50,v=concat(v,-prime(n)-sum(i=1,n-1,prime(i)*v[#v-i+1])));v \\ _Derek Orr_, Apr 28 2015

%Y Cf. A000040, A072508, A340991.

%K sign

%O 0,2

%A _N. J. A. Sloane_