cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A070960 a(1) = 1; a(n) = n!*(3/2) for n>=2.

This page as a plain text file.
%I A070960 #34 Apr 15 2024 13:12:33
%S A070960 1,3,9,36,180,1080,7560,60480,544320,5443200,59875200,718502400,
%T A070960 9340531200,130767436800,1961511552000,31384184832000,533531142144000,
%U A070960 9603560558592000,182467650613248000,3649353012264960000,76636413257564160000,1686001091666411520000,38778025108327464960000
%N A070960 a(1) = 1; a(n) = n!*(3/2) for n>=2.
%C A070960 Let g be a permutation of [1..n] having, say, j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_{g} Sum_{i} (j_1 + j_2). - _N. J. A. Sloane_, Jul 22 2009
%C A070960 a(n) is the greatest integer that can be obtained from the integers {1, 2, 3, ..., n} using each number at most once and the operators +, -, *, /.
%H A070960 Reinhard Zumkeller, <a href="/A070960/b070960.txt">Table of n, a(n) for n = 1..400</a>
%H A070960 Jun Yan, <a href="https://arxiv.org/abs/2404.07958">Results on pattern avoidance in parking functions</a>, arXiv:2404.07958 [math.CO], 2024. See p. 4.
%H A070960 <a href="/index/Fo#4x4">Index entries for similar sequences</a>.
%F A070960 E.g.f.: x*(2+x)/(1-x)/2. - _Vladeta Jovovic_, Dec 15 2002
%F A070960 a(n) = A245334(n,n-2), n > 1. - _Reinhard Zumkeller_, Aug 31 2014
%F A070960 From _Amiram Eldar_, Jan 15 2023: (Start)
%F A070960 Sum_{n>=1} 1/a(n) = (2*e-1)/3.
%F A070960 Sum_{n>=1} (-1)^(n+1)/a(n) = 1 - 2/(3*e). (End)
%F A070960 a(n) = A000142(n) + A001710(n) for n>=2. - _Alois P. Heinz_, Feb 20 2024
%e A070960 a(5) = 180 because the greatest number we can obtain using 1, 2, 3, 4, 5 is 180 which is (1+2)*3*4*5.
%t A070960 s=3;lst={1, s};Do[s+=n*s+s;AppendTo[lst, s], {n, 1, 5!, 1}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 08 2008 *)
%t A070960 Join[{1},(3*Range[2,20]!)/2] (* _Harvey P. Dale_, Jun 15 2022 *)
%o A070960 (Haskell)
%o A070960 a070960 n = if n == 1 then 1 else 3 * a000142 n `div` 2
%o A070960 a070960_list = map (flip div 2) fs where fs = 3 : zipWith (*) [2..] fs
%o A070960 -- _Reinhard Zumkeller_, Aug 31 2014
%o A070960 (PARI) a(n) = if (n==1, 1, n!*3/2); \\ _Michel Marcus_, Dec 03 2022
%Y A070960 Cf. A000142, A001710, A060315.
%Y A070960 Cf. A245334.
%K A070960 easy,nonn
%O A070960 1,2
%A A070960 Koksal Karakus (karakusk(AT)hotmail.com), May 24 2002
%E A070960 Edited by _N. J. A. Sloane_, Jul 22 2009