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.

A356568 a(n) = (4^n - 1)*n^(2*n).

Original entry on oeis.org

0, 3, 240, 45927, 16711680, 9990234375, 8913923665920, 11111328602485167, 18446462598732840960, 39346257980661240576303, 104857500000000000000000000, 341427795961470170556885610263, 1333735697353436921058237339402240, 6156119488473827117528057630000587767
Offset: 0

Views

Author

Enrique Navarrete, Sep 30 2022

Keywords

Comments

If S = {1,2,3,...,2n}, a(n) is the number of functions from S to S such that at least one even number is mapped to an odd number or at least one odd number is mapped to an even number.
Note the result can be obtained as (2*n)^(2*n) - n^(2*n), which is the number of functions from S to S minus the number of functions from S to S that map each even number to an even number and each odd number to an odd number. Hence in particular a(0) = 1-1 = 0.

Examples

			For n=1, the functions are f1: (1,1),(2,1); f2: (1,2),(2,2); f3: (1,2),(2,1).
		

Crossrefs

Programs

Formula

a(n) = A085534(n) - A062206(n).