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!)
A339844 Number of distinct sorted degree sequences among all n-vertex loop-graphs. 9
1, 2, 6, 16, 51, 162, 554 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

In the covering case, these degree sequences, sorted in decreasing order, are the same thing as loop-graphical partitions (A339656). An integer partition is loop-graphical if it comprises the multiset of vertex-degrees of some graph with loops, where a loop is an edge with two equal vertices.

The following are equivalent characteristics for any positive integer n:

(1) the prime indices of n can be partitioned into distinct pairs, i.e. into a set of loops and edges;

(2) n can be factored into distinct semiprimes;

(3) the prime signature of n is loop-graphical.

LINKS

Table of n, a(n) for n=0..6.

Eric Weisstein's World of Mathematics, Degree Sequence.

Gus Wiseman, Counting and ranking factorizations, factorability, and vertex-degree partitions for groupings into pairs.

EXAMPLE

The a(0) = 1 through a(3) = 16 sorted degree sequences:

  ()  (0)  (0,0)  (0,0,0)

      (2)  (0,2)  (0,0,2)

           (1,1)  (0,1,1)

           (1,3)  (0,1,3)

           (2,2)  (0,2,2)

           (3,3)  (0,3,3)

                  (1,1,2)

                  (1,1,4)

                  (1,2,3)

                  (1,3,4)

                  (2,2,2)

                  (2,2,4)

                  (2,3,3)

                  (2,4,4)

                  (3,3,4)

                  (4,4,4)

For example, the loop-graphs

  {{1,1},{2,2},{3,3},{1,2}}

  {{1,1},{2,2},{3,3},{1,3}}

  {{1,1},{2,2},{3,3},{2,3}}

  {{1,1},{2,2},{1,3},{2,3}}

  {{1,1},{3,3},{1,2},{2,3}}

  {{2,2},{3,3},{1,2},{1,3}}

all have degrees y = (3,3,2), so y is counted under a(3).

MATHEMATICA

Table[Length[Union[Sort[Table[Count[Join@@#, i], {i, n}]]&/@Subsets[Subsets[Range[n], {1, 2}]/.{x_Integer}:>{x, x}]]], {n, 0, 5}]

CROSSREFS

See link for additional cross references.

The version without loops is A004251, with covering case A095268.

The half-loop version is A029889, with covering case A339843.

Loop-graphs are counted by A322661 and ranked by A320461 and A340020.

The covering case (no zeros) is A339845.

A007717 counts unlabeled multiset partitions into pairs.

A027187 counts partitions of even length, with Heinz numbers A028260.

A058696 counts partitions of even numbers, ranked by A300061.

A101048 counts partitions into semiprimes.

A339655 counts non-loop-graphical partitions of 2n.

A339656 counts loop-graphical partitions of 2n.

A339659 counts graphical partitions of 2n into k parts.

Cf. A001358, A006125, A006129, A062740, A338898, A339841.

Sequence in context: A136509 A100664 A317094 * A258797 A214983 A214833

Adjacent sequences:  A339841 A339842 A339843 * A339845 A339846 A339847

KEYWORD

nonn,more

AUTHOR

Gus Wiseman, Dec 27 2020

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 May 14 19:53 EDT 2021. Contains 343903 sequences. (Running on oeis4.)