login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068568 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. 1
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; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

R. K. Guy, Unsolved Problems in Number Theory, B30.

LINKS

Table of n, a(n) for n=0..77.

CROSSREFS

Sequence in context: A220854 A122816 A064007 * A073169 A166268 A239669

Adjacent sequences:  A068565 A068566 A068567 * A068569 A068570 A068571

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto, Mar 26 2002

STATUS

approved

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 July 12 19:26 EDT 2020. Contains 335668 sequences. (Running on oeis4.)