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.

A276940 a(1) = 2; for n > 1, a(n) = (n-2)! * n^3.

This page as a plain text file.
%I A276940 #9 Apr 14 2017 13:06:07
%S A276940 2,8,27,128,750,5184,41160,368640,3674160,40320000,482993280,
%T A276940 6270566400,87697209600,1314380390400,21016195200000,357082280755200,
%U A276940 6424604169984000,122021710626816000,2439660069310464000,51218989645824000000,1126555274886193152000,25905540583064862720000,621623493403188756480000,15538186060797648568320000
%N A276940 a(1) = 2; for n > 1, a(n) = (n-2)! * n^3.
%C A276940 In factorial base representation (A007623) the terms are written as: 10, 110, 1011, 10110, 101100, 1011000, 10110000, ... From a(3) = 27 = "1011" onward each term begins always with "1011", followed by n-3 zeros. - _Antti Karttunen_, Sep 24 2016
%H A276940 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A276940 a(1) = 2; for n > 1, a(n) = (n-2)! * n^3.
%F A276940 a(n) = n * A054119(n).
%F A276940 For n >= 3, a(n) = (n+1)! + (n-1)! + (n-2)!.
%t A276940 Join[{2},Table[(n-2)! n^3,{n,2,30}]] (* _Harvey P. Dale_, Apr 14 2017 *)
%o A276940 (Scheme, two alternatives)
%o A276940 (define (A276940 n) (if (= 1 n) 2 (* n n n (A000142 (- n 2)))))
%o A276940 (define (A276940 n) (cond ((= 1 n) 2) ((= 2 n) 8) (else (+ (A000142 (+ 1 n)) (A000142 (- n 1)) (A000142 (- n 2))))))
%Y A276940 Cf. A000142, A000578, A054119.
%Y A276940 Row 20 of A276955 (from a(3) = 27 onward).
%K A276940 nonn,base
%O A276940 1,1
%A A276940 _Antti Karttunen_, Sep 24 2016