This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A102818 Array with row lengths of 16, rows indexed from n=3 to 9, columns from m=1 to 16, such that a(n,m) = A001035(m) modulo n. A001035 is the number of partially ordered sets with n labeled elements. 1
 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 4, 4, 1, 3, 4, 4, 1, 3, 4, 4, 1, 3, 4, 4, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 5, 2, 3, 5, 1, 3, 5, 2, 3, 5, 1, 3, 5, 2, 1, 3, 3, 3, 7, 7, 3, 3, 7, 7, 3, 3, 7, 7, 3, 3, 1, 3, 1, 3, 1, 0, 4, 3, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,18 COMMENTS Conjectures (based on mod values up to n=99): the sequence A001035(m) is (pre)periodic modulo n for all n, the lengths of the ending periods mod n (except n=4) being given by A011773 (which is related to Carmichael's lambda function). LINKS MATHEMATICA seq = List[1, 3, 19, 219, 4231, 130023, 6129859, 431723379, 44511042511, 6611065248783, 1396281677105899, 414864951055853499, 171850728381587059351, 98484324257128207032183, 77567171020440688353049939, 83480529785490157813844256579] Table[Mod[seq, i], {i, 3, 9}] CROSSREFS Cf. A001035 A011773 A002322. Sequence in context: A122845 A135203 A179804 * A010701 A174971 A122553 Adjacent sequences:  A102815 A102816 A102817 * A102819 A102820 A102821 KEYWORD nonn,uned AUTHOR Gerald McGarvey, Feb 26 2005 STATUS approved

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 .