id:A068568 - OEIS Search Results

Search: id:A068568

Displaying 1-1 of 1 results found.

page 1

Let S = a subset of {n,n+1,n+2,..,n+m}, number of parts of S is more than 1. a(n) = smallest number m such that the product of parts of S is a square.

+0
2

1, 3, 4, 5, 5, 5, 6, 7, 7, 7, 8, 9, 8, 8, 7, 9, 9, 10, 9, 9, 8, 7, 10, 9, 8, 10, 9, 8, 12, 13, 12, 13, 12, 11, 14, 13, 13, 13, 12, 11, 10, 13, 12, 11, 10, 9, 8, 7, 6, 14, 13, 14, 13, 13, 12, 11, 16, 18, 17, 16, 15, 16, 15, 14, 14, 13, 14, 17, 16, 15, 14, 17, 16, 17, 16, 15, 15, 14 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`R. K. Guy, Unsolved Problems in Number Theory, B30.`
	CROSSREFS	`Adjacent sequences: A068565 A068566 A068567 this_sequence A068569 A068570 A068571` `Sequence in context: A128999 A122816 A064007 this_sequence A073169 A120677 A098200`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Mar 26 2002`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research