login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326995 a(n) = A002105(n+1) - A005046(n), reduced tangent numbers minus the number of partitions of a 2*n-set into even blocks. 1
0, 0, 0, 3, 117, 4500, 199155, 10499643, 663488532, 50115742365, 4497657826905, 476074241776188, 58963860817626567, 8475738174076417335, 1402598717609785850700, 265126817539686778513113, 56822367893441673215117997, 13712983199783483607459996660, 3702793973661590950848375537915 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Peter Luschny, The Bell transform.
FORMULA
a(n) = (-2)^(n+1)*Euler(2*n+1, 0) - b(n) where b(n) is the sum of row 2*n + 1 of the Bell transform of n mod 2. The Bell transform is defined in A264428.
MAPLE
B := BellMatrix(n -> modp(n, 2), 37): # defined in A264428.
b := n -> add(k, k in B[2*n+1]):
seq(euler(2*n+1, 0)*(-2)^(n+1) - b(n), n=0..18);
CROSSREFS
Cf. A125107 (row 0 of A327000), A048742 (row 1 of A327000), this sequence (row 2 of A327000).
Sequence in context: A132304 A097642 A009095 * A155209 A037117 A283883
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 12:09 EDT 2024. Contains 371838 sequences. (Running on oeis4.)