id:A105974 - OEIS Search Results

Search: id:A105974

Displaying 1-1 of 1 results found.

page 1

(A001035(n) - 1)/2 where A001035 is the number of partially ordered sets ("posets") with n labeled elements.

+0
1

0, 0, 1, 9, 109, 2115, 65011, 3064929, 215861689, 22255521255, 3305532624391, 698140838552949, 207432475527926749, 85925364190793529675, 49242162128564103516091, 38783585510220344176524969 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`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: A001691 A058421 A128876 this_sequence A053912 A053894 A053904` `Adjacent sequences: A105971 A105972 A105973 this_sequence A105975 A105976 A105977`
	KEYWORD	`nonn`
	AUTHOR	`Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Apr 28 2005`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research