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!)
A259688 Related to Euler numbers. 1
1, 2, 8, 16, 136, 272, 3968, 7936, 176896, 353792, 11184128, 22368256, 951878656, 1903757312, 104932671488, 209865342976, 14544442556416, 29088885112832, 2475749026562048, 4951498053124096, 507711943253426176, 1015423886506852352, 123460740095103991808 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
C. Krishnamachary and M. Bheemasena Rao, Determinants whose elements are Eulerian, prepared Bernoullian and other numbers, J. Indian Math. Soc., 14 (1922), 55-62, 122-138 and 143-146. See p. 146. [Annotated scanned copy]
FORMULA
a(2n+1) = b(2n+3) for n >= 0, a(2n) = b(2n+3)/2 for n >= 0 where b(n) = A000111(n). - Mikhail Kurkov, Jun 13 2023 [verification needed]
MAPLE
b:= proc(u, o) option remember;
`if`(u+o=0, 1, add(b(o-1+j, u-j), j=1..u))
end:
a:= n-> `if`(n::odd, b(n+2, 0), a(n+1)/2):
seq(a(n), n=0..24); # Alois P. Heinz, Jun 15 2023
MATHEMATICA
a[n_] := 2^Mod[n, 2]*Abs[PolyLog[-(n + 3 - Mod[n, 2]), I]];
Table[a[n], {n, 0, 24}] (* Jean-François Alcover, Dec 02 2023, after Mikhail Kurkov *) [verification needed]
PROG
(PARI) a(n) = 2^(n%2)*abs(polylog(-(n + 3 - n%2), I)) \\ Mikhail Kurkov, Jun 13 2023 [verification needed]
CROSSREFS
Sequence in context: A092978 A280777 A013516 * A101059 A191999 A101658
KEYWORD
nonn,changed
AUTHOR
N. J. A. Sloane, Jul 04 2015
EXTENSIONS
More terms from Mikhail Kurkov, Jun 13 2023 [verification needed]
a(0)=1 prepended by Alois P. Heinz, Jun 13 2023
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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)