Search: id:A007446
Results 1-1 of 1 results found.

%I A007446 M1785
%S A007446 1,2,7,31,162,973,6539,48410,390097,3389877,31534538,312151125,
%T A007446 3271508959,36149187780,419604275375,5100408982825,64743452239424,
%U A007446 856157851884881,11768914560546973,167841252874889898
%N A007446 Exponentiation of e.g.f. for primes.
%C A007446 Contribution from Tilman Neumann (Tilman.Neumann(AT)web.de), Oct 05 2008: 
               (Start)
%C A007446 a(n) is also given by
%C A007446 - substituting the primes (A000040) into (the simplest) Faa di Bruno's 
               formula, or
%C A007446 - the complete Bell polynomial of the first n prime arguments, or
%C A007446 - computing n.th moments from the first n primes as cumulants
%C A007446 The examples show that the coefficients of the prime power products are 
               just A036040/A080575 (these are just rearrangements of the same coefficients). 
               Moreover, the prime products of the additional terms span the whole 
               space of natural numbers, thus what we see here is a reordering of 
               the natural numbers! (End)
%D A007446 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%e A007446 Contribution from Tilman Neumann (Tilman.Neumann(AT)web.de), Oct 05 2008: 
               (Start)
%e A007446 Let p_i denote the i.th prime (A000040). Then
%e A007446 a(1)=2 = 1*p_1
%e A007446 a(2)=7 = 1*p_2 + 1*p_1^2
%e A007446 a(3)=31 = 1*p_3 + 3*p_2*p_1 + 1*p_1^3
%e A007446 a(4)=162= 1*p_4 + 4*p_3*p_1 + 3*p_2^2 + 6*p_2*p_1^2 + 1*p_1^4
%e A007446 a(5)=973= 1*p_5 + 5*p_4*p_1 + 10*p_3*p_2 + 10*p_3*p_1^2 + 15*p_2^2*p_1 
               + 10*p_2*p_1^3 + 1*p_1^5
%e A007446 (End)
%o A007446 Contribution from Tilman Neumann (Tilman.Neumann(AT)web.de), Oct 05 2008: 
               (Start)
%o A007446 (Other) completeBellMatrix := proc(x,n)
%o A007446 // x - vector x[1]...x[m], m>=n
%o A007446 local i,j,M;
%o A007446 begin
%o A007446 M:=matrix(n,n): // zero-initialized
%o A007446 for i from 1 to n-1 do
%o A007446 M[i,i+1]:=-1:
%o A007446 end_for:
%o A007446 for i from 1 to n do
%o A007446 for j from 1 to i do
%o A007446 M[i,j] := binomial(i-1,j-1)*x[i-j+1]:
%o A007446 end_for:
%o A007446 end_for:
%o A007446 return (M):
%o A007446 end_proc:
%o A007446 completeBellPoly := proc(x, n)
%o A007446 begin
%o A007446 return (linalg::det(completeBellMatrix(x,n))):
%o A007446 end_proc:
%o A007446 x:=[2,3,5,7,11,13,17,19,23,29]:
%o A007446 for i from 1 to 10 do print(i,completeBellPoly(x,i)): end_for:
%o A007446 (End)
%Y A007446 Cf. A036040, A080575, A000040 [From Tilman Neumann (Tilman.Neumann(AT)web.de), 
               Oct 05 2008]
%Y A007446 Sequence in context: A030966 A009132 A125275 this_sequence A002872 A105216 
               A005977
%Y A007446 Adjacent sequences: A007443 A007444 A007445 this_sequence A007447 A007448 
               A007449
%K A007446 easy,nonn
%O A007446 0,2
%A A007446 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds