VOOZH about

URL: https://oeis.org/history?seq=A054747

⇱ The On-Line Encyclopedia of Integer Sequences (OEIS)

login

Showing entries 1-10 | older changes
Number of inequivalent n-state 2-input 2-output automata with respect to an input permutation.
#25 by N. J. A. Sloane at Mon Mar 08 22:51:18 EST 2021
STATUS
#24 by Petros Hadjicostas at Mon Mar 08 19:36:23 EST 2021
STATUS
#23 by Petros Hadjicostas at Mon Mar 08 19:36:19 EST 2021
LINKS
STATUS
#22 by Peter Luschny at Mon Mar 08 15:16:06 EST 2021
STATUS
#21 by Peter Luschny at Mon Mar 08 15:12:48 EST 2021
PROG
STATUS
Discussion
Mon Mar 08
15:13
Peter Luschny: A unique name makes things directly citable. This is true for programs as well as for sequences.
15:15
Petros Hadjicostas: Thanks, Peter.
#20 by Petros Hadjicostas at Mon Mar 08 12:01:26 EST 2021
STATUS
Discussion
Mon Mar 08
12:27
Michel Marcus: there is inverse euler transform in https://oeis.org/transforms_pari.txt
#19 by Petros Hadjicostas at Mon Mar 08 12:01:19 EST 2021
CROSSREFS
STATUS
#18 by Petros Hadjicostas at Mon Mar 08 11:17:30 EST 2021
STATUS
Discussion
Mon Mar 08
11:21
Petros Hadjicostas: If Alois can use my PARI program above and/or Theorem 6.2 (p. 107) with k = p = 2 (where <...> means lcm and partition elements have 0 frequency beyond n or p etc.), then he can double check whether A000282 is the inverse Euler transform of this one or vice versa. We can also get a program for A000282 for the first time.
11:23
Petros Hadjicostas: Right now I do not know how to incorporate inverse Euler transform in PARI (especially in the complicated PARI program by Hasler above). Neil has Maple programs for that.
#17 by Petros Hadjicostas at Mon Mar 08 11:14:11 EST 2021
DATA
EXTENSIONS
#16 by Petros Hadjicostas at Mon Mar 08 11:13:08 EST 2021
DATA