login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090989 Number of meaningful differential operations of the n-th order on the space R^4. 14

%I #23 Apr 19 2023 02:22:14

%S 4,6,8,12,16,24,32,48,64,96,128,192,256,384,512,768,1024,1536,2048,

%T 3072,4096,6144,8192,12288,16384,24576,32768,49152,65536,98304,131072,

%U 196608,262144,393216,524288,786432,1048576,1572864,2097152,3145728,4194304,6291456,8388608

%N Number of meaningful differential operations of the n-th order on the space R^4.

%H G. C. Greubel, <a href="/A090989/b090989.txt">Table of n, a(n) for n = 1..1000</a>

%H B. Malesevic, <a href="https://www.jstor.org/stable/43666958">Some combinatorial aspects of differential operation composition on the space R^n </a>, Univ. Beograd, Publ. Elektrotehn. Fak., Ser. Mat. 9 (1998), 29-33.

%H Branko Malesevic, <a href="http://arxiv.org/abs/0704.0750">Some combinatorial aspects of differential operation compositions on space R^n</a>, arXiv:0704.0750 [math.DG], 2007.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,2).

%F a(k+2) = 2*a(k).

%F a(n)= gcdConv(0, {A000079})[n+3]. - _Tilman Neumann_, Jan 11 2009

%F G.f.: 2*x*(2+3*x)/(1-2*x^2). - _Colin Barker_, May 03 2012

%F a(n) = 2*A164090(n). - _R. J. Mathar_, Jan 25 2023

%p NUM := proc(k :: integer) local i,j,n,Fun,Identity,v,A; n := 4; # <- DIMENSION Fun := (i,j)->piecewise(((j=i+1) or (i+j=n+1)),1,0); Identity := (i,j)->piecewise(i=j,1,0); v := matrix(1,n,1); A := piecewise(k>1,(matrix(n,n,Fun))^(k-1),k=1,matrix(n,n,Identity)); return(evalm(v&*A&*transpose(v))[1,1]); end:

%t LinearRecurrence[{0,2}, {4,6}, 40] (* _G. C. Greubel_, Feb 02 2019 *)

%o (PARI) my(x='x+O('x^40)); Vec(2*x*(2+3*x)/(1-2*x^2)) \\ _G. C. Greubel_, Feb 02 2019

%o (Magma) m:=40; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!( 2*x*(2+3*x)/(1-2*x^2) )); // _G. C. Greubel_, Feb 02 2019

%o (Sage) (2*(2+3*x)/(1-2*x^2)).series(x, 40).coefficients(x, sparse=False) # _G. C. Greubel_, Feb 02 2019

%o (GAP) a:=[4,6];; for n in [3..40] do a[n]:=2*a[n-2]; od; a; # _G. C. Greubel_, Feb 02 2019

%Y Cf. A063759, A029744, A090990-A090995.

%K nonn,easy

%O 1,1

%A _Branko Malesevic_, Feb 29 2004

%E More terms from _Tilman Neumann_, Feb 06 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:31 EDT 2024. Contains 371240 sequences. (Running on oeis4.)