id:A092488 - OEIS Search Results

Search: id:A092488

Displaying 1-1 of 1 results found.

page 1

a(n) = least k such that {n+0, n+1, n+2, n+3, ... n+k} has a non-empty subset the product of whose members is a square.

+0
2

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

	OFFSET	`1,2`
	REFERENCES	`R. K. Guy, Unsolved Problems in Number Theory, B30.`
	EXAMPLE	`Often a(n) is the distance from n to the next square. But e.g. a(26)=9 (not 10) because 2728303235 is a square.`
	CROSSREFS	`Cf. A068527, A068568, A092487.` `Sequence in context: A106375 A131667 A086802 this_sequence A068527 A049243 A077908` `Adjacent sequences: A092485 A092486 A092487 this_sequence A092489 A092490 A092491`
	KEYWORD	`nonn,easy`
	AUTHOR	`R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Apr 02 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research