login

Revision History for A058801

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of connected vertically indecomposable partial lattices on n unlabeled nodes.
(history; published version)
#13 by Peter Luschny at Tue Mar 17 19:31:40 EDT 2020
STATUS

proposed

approved

#12 by Jean-François Alcover at Tue Mar 17 13:28:44 EDT 2020
STATUS

editing

proposed

#11 by Jean-François Alcover at Tue Mar 17 13:28:39 EDT 2020
MATHEMATICA

A058800 = DeleteCasesCases[Import["https://oeis.org/A058800/b058800.txt", "Table"], a_ /; ! MatchQ[a, {_Integer, _Integer, _}]][[All, 2]];

mob[m_, n_] := If[Mod[m, n] == 0, MoebiusMu[m/n], 0];

EULERi[b_List] := Module[{a, c, i, d}, c = {}; For[i = 1, i <= Length[b], i++, c = Append[c, i*b[[i]] - Sum[c[[d]]*b[[i - d]], {d, 1, i - 1}]]]; a = {}; For[i = 1, i <= Length[b], i++, a = Append[a, (1/i)*Sum[mob[i, d]*c[[d]], {d, 1, i}]]]; Return[a]];

(* EulerInvTransform is defined in A022562 *)

EULERiEulerInvTransform[Drop[A058800, 3]] // Rest (* Jean-François Alcover, May 10 2019 , updated Mar 17 2020 *)

STATUS

approved

editing

#10 by Alois P. Heinz at Fri May 10 10:36:18 EDT 2019
STATUS

proposed

approved

#9 by Jean-François Alcover at Fri May 10 10:20:16 EDT 2019
STATUS

editing

proposed

#8 by Jean-François Alcover at Fri May 10 10:19:15 EDT 2019
EXTENSIONS

a(1517)-a(1618) (computed from A058800) from Jean-François Alcover, May 10 2019

STATUS

proposed

editing

#7 by Jean-François Alcover at Fri May 10 10:17:43 EDT 2019
STATUS

editing

proposed

#6 by Jean-François Alcover at Fri May 10 10:17:34 EDT 2019
DATA

1, 2, 6, 25, 116, 625, 3757, 25140, 184511, 1473861, 12711339, 117598686, 1160399052, 12152333659, 134487937252, 1566878426731, 19154490559458

MATHEMATICA

A058800 = DeleteCases[Import["https://oeis.org/A058800/b058800.txt", "Table"], a_ /; ! MatchQ[a, {_Integer, _Integer}]][[All, 2]];

mob[m_, n_] := If[Mod[m, n] == 0, MoebiusMu[m/n], 0];

EULERi[b_List] := Module[{a, c, i, d}, c = {}; For[i = 1, i <= Length[b], i++, c = Append[c, i*b[[i]] - Sum[c[[d]]*b[[i - d]], {d, 1, i - 1}]]]; a = {}; For[i = 1, i <= Length[b], i++, a = Append[a, (1/i)*Sum[mob[i, d]*c[[d]], {d, 1, i}]]]; Return[a]];

EULERi[Drop[A058800, 3]] // Rest (* Jean-François Alcover, May 10 2019 *)

EXTENSIONS

a(15)-a(16) (computed from A058800) from Jean-François Alcover, May 10 2019

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 17:37:12 EDT 2012
AUTHOR

_Christian G. Bower (bowerc(AT)usa.net), _, Dec 28 2000

Discussion
Fri Mar 30
17:37
OEIS Server: https://oeis.org/edit/global/178
#4 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

KEYWORD

nonn,hard,new