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!)
A298419 a(n) = n*a(n-1) - a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1. 1

%I #4 Feb 11 2018 10:52:53

%S 1,1,1,3,12,58,339,2318,18217,161647,1598311,17419832,207440012,

%T 2679300663,37302771588,556862275475,8872493654229,150275529864635,

%U 2696087044070848,51075378307643124,1018811479110389943,21343965683012143990,468548433547174197669

%N a(n) = n*a(n-1) - a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1.

%H Clark Kimberling, <a href="/A298419/b298419.txt">Table of n, a(n) for n = 0..1000</a>

%t a[0] = 1; a[1] = 1; a[2] = 1;

%t a[n_] := a[n] = n a[n - 1] - a[n - 2] + a[Floor[n/2]];

%t Table[a[n], {n, 0, 30}] (* A298419 *)

%Y Cf. A298338.

%K nonn,easy

%O 0,4

%A _Clark Kimberling_, Feb 11 2018

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 September 6 15:39 EDT 2024. Contains 375715 sequences. (Running on oeis4.)