login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327006 a(n) = A327005(n, n). 1
1, 0, 1, 2, 6, 24, 105, 510, 2765, 16408, 105210, 724580, 5330149, 41649828, 344120777, 2995027126, 27368953170, 261825429024, 2615385871053, 27216432127818, 294443944669341, 3305528914953420, 38442535155671262, 462431164589185924, 5745587267806107545 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..25.

Peter Luschny, The Bell transform.

FORMULA

a(n) = Sum_{k=1..n} BM[n][k] where BM is the BellMatrix(j -> j mod n) as defined in A264428.

MAPLE

# BellMatrix is defined in A264428.

a := proc(n) BellMatrix(j -> modp(j, n), n): add(i, i in %[n]) end:

seq(a(n), n=1..25);

CROSSREFS

Cf. A327005, A264428.

Sequence in context: A152321 A152323 A171338 * A163824 A094433 A178594

Adjacent sequences:  A327003 A327004 A327005 * A327007 A327008 A327009

KEYWORD

nonn

AUTHOR

Peter Luschny, Aug 13 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 28 13:29 EST 2020. Contains 331321 sequences. (Running on oeis4.)