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.

A075473 n^n + n! - 2*(n+1)^(n-1).

Original entry on oeis.org

0, 0, 0, 1, 30, 653, 13762, 304295, 7251598, 187783369, 5287733418, 161516858963, 5332258661782, 189493508862461, 7219703867130466, 293780009979371503, 12721918893479808030, 584361555380576356625, 28385640762100638931546
Offset: 0

Views

Author

Henry Bottomley, Oct 11 2002

Keywords

Comments

Possibly the number of patterns for forming an ordered sum of n values v1+v2+...+vn chosen (possibly with repetition) from {b1,b2,...,bn} with b1

Examples

			a(2)=2^2+2!-2*3^1=4+2-6=0. a(3)=3^3+3!-2*4^2=27+6-32=1. a(4)=4^4+4!-2*5^3=256+24-250=30.

Formula

a(n) =A000312(n)+A000142(n)-2*A000272(n+1)

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.