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!)
A007122 Number of unlabeled identity connected unit interval graphs with n nodes.
(Formerly M1288)
2

%I M1288

%S 0,0,0,0,0,2,4,15,36,108,276,770,2036,5586,15072,41370,113184,312488,

%T 863824,2401344,6692368,18724990,52531788,147824963,417006316,

%U 1179285900,3342274092,9492427854,27011049612,76999988534

%N Number of unlabeled identity connected unit interval graphs with n nodes.

%D R. W. Robinson, personal communication.

%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H R. W. Robinson, <a href="/A007122/b007122.txt">Table of n, a(n) for n = 1..190</a>

%Y Cf. A005219.

%K nonn,nice

%O 1,6

%A _N. J. A. Sloane_.

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 June 24 00:08 EDT 2021. Contains 345403 sequences. (Running on oeis4.)