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!)
A192264 a(1)=1, a(2)=2; a(n) = abs((n-1)*a(n-1) - n*a(n-2)), n > 2. 1

%I #14 Feb 23 2019 21:54:19

%S 1,2,1,5,15,45,165,795,4875,35925,305625,2930775,31196175,364519425,

%T 4635329325,63697629075,940361466675,14839587610125,249245709115425,

%U 4438876720990575,83543374528387575,1656755577234346425,34527125085002707125

%N a(1)=1, a(2)=2; a(n) = abs((n-1)*a(n-1) - n*a(n-2)), n > 2.

%F a(n) = abs((n-1)*a(n-1) - n*a(n-2)), a(1) = 1, a(2) = 2.

%e a(3) = abs(a(2)*(3-1) - a(1)*3) = abs(2*2 - 1*3) = 1;

%e a(4) = abs(a(3)*(4-1) - a(2)*4) = abs(1*3 - 2*4) = 5;

%e a(5) = abs(a(4)*(5-1) - a(3)*5) = abs(5*4 - 1*5) = 15.

%p A192264 := proc(n) if n <=2 then n; else abs( (n-1)*procname(n-1)-n*procname(n-2)) ; end if; end proc: # _R. J. Mathar_, Jun 27 2011

%t a[1] = 1; a[2] = 2; a[n_] := a[n] = Abs[(n-1)*a[n-1] - n*a[n-2]]; Table[a[n], {n, 30}]

%o (MATLAB)

%o % n = number of computed terms of sequence

%o a(1)=1; a(2)=2;

%o for i=3:n,

%o a(i,1) = abs(a(i-1)*(i-1) - a(i-2)*i) ;

%o end

%K nonn

%O 1,2

%A _Pasi Airikka_, Jun 27 2011

%E Corrected and edited by _R. J. Mathar_, Jun 27 2011

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 August 13 07:44 EDT 2024. Contains 375113 sequences. (Running on oeis4.)