login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057765 Number of factorable subsets of a 1 X n uniform grid. 2

%I

%S 0,0,0,1,3,8,20,45,89,174,323,590,1048,1834,3135,5361,8977,14993,24859

%N Number of factorable subsets of a 1 X n uniform grid.

%C A set is factorable if it is the union of at least two disjoint translated copies of a subset of at least two elements. E.g. the subset *..*.**..***.*.* of the 1x16 grid (where * denotes gridpoints in the selected subset and . denotes the remaining unselected gridpoints) is factorable into 3 copies of the 3-element subset *..*.*, as shown by displaying the factors by 1..1.12..232.3.3, where the numerals denote the elements of a particular translated copy.

%e The factorable subsets of (......) are (1122..), (11.22.), (.1122.), (1.12.2), (11..22), (.11.22), (..1122) and (111222), so a(6)=8.

%Y Cf. A057750.

%K nonn

%O 1,5

%A _John W. Layman_, Oct 30 2000

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 January 25 11:49 EST 2022. Contains 350567 sequences. (Running on oeis4.)