login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105974 (A001035(n) - 1)/2 where A001035 is the number of partially ordered sets ("posets") with n labeled elements. 0
0, 0, 1, 9, 109, 2115, 65011, 3064929, 215861689, 22255521255, 3305532624391, 698140838552949, 207432475527926749, 85925364190793529675, 49242162128564103516091, 38783585510220344176524969 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

Conjectures: a(n) is (pre)periodic modulo m for all m, the lengths of the ending periods being given by 2*A000010(m) if m is a power of 2 and A000010(m) otherwise. A0000100 is Euler's totient function.

CROSSREFS

Cf. A001035, A000010, A102818.

Sequence in context: A058421 A128876 A199030 * A053912 A053894 A053904

Adjacent sequences:  A105971 A105972 A105973 * A105975 A105976 A105977

KEYWORD

nonn

AUTHOR

Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Apr 28 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.