Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104429
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104429 Number of ways to split 1, 2, 3, ..., 3n into n arithmetical progressions each with 3 terms. +0
15
1, 2, 5, 15, 55, 232, 1161, 6643, 44566 (list; graph; listen)
OFFSET

1,2

EXAMPLE

{{{1,2,3},{4,5,6},{7,8,9}}, {{1,2,3},{4,6,8},{5,7,9}}, {{1,3,5},{2,4,6},{7,8,9}}, {{1,4,7},{2,5,8},{3,6,9}}, {{1,5,9},{2,3,4},{6,7,8}}}

are the 5 ways to split 1, 2, 3, ..., 9 into 3 arithemetical progressions each with 3 elements. Thus a(3)=5.

CROSSREFS

Cf. A104430-A104443.

Sequence in context: A107112 A051295 A009383 this_sequence A109319 A059219 A137533

Adjacent sequences: A104426 A104427 A104428 this_sequence A104430 A104431 A104432

KEYWORD

nonn

AUTHOR

Jonas Wallgren (jonwa(AT)ida.liu.se), Mar 17 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research