id:A139401 - OEIS Search Results

Search: id:A139401

Displaying 1-1 of 1 results found.

page 1

If n is a square, a(n) is 0. Otherwise, a(n) is the smallest number d for which a sequence that has a common difference of d contains n but that has no squares.

+0
1

0, 3, 4, 0, 3, 4, 4, 3, 0, 4, 3, 5, 5, 3, 4, 0, 3, 4, 4, 3, 8, 4, 3, 7, 0, 3, 4, 5, 3, 4, 4, 3, 5, 4, 3, 0, 5, 3, 4, 7, 3, 4, 4, 3, 7, 4, 3, 5, 0, 3, 4, 5, 3, 4, 4, 3, 5, 4, 3, 9, 7, 3, 4, 0, 3, 4, 4, 3, 7, 4, 3, 5, 5, 3, 4, 7, 3, 4, 4, 3, 0, 4, 3, 9, 8, 3, 4, 5, 3, 4, 4, 3, 5, 4, 3, 7, 5, 3, 4, 0, 3, 4, 4, 3, 9 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`All nonzero values in this sequence are at least 3.` `Records of nonzero values in this sequence are in A066730`
	EXAMPLE	`a(2) = 3 because there are no squares in the sequence 2, 5, 8, 11, 14, 17, 20...`
	CROSSREFS	`Cf. A066730.` `Sequence in context: A124917 A025278 A063405 this_sequence A110061 A021750 A086230` `Adjacent sequences: A139398 A139399 A139400 this_sequence A139402 A139403 A139404`
	KEYWORD	`nonn`
	AUTHOR	`J. Lowell (jhbubby(AT)mindspring.com), Jun 09 2008, Jun 10 2008`
	EXTENSIONS	`More terms from John W. Layman (layman(AT)math.vt.edu), Jun 17 2008`

page 1

Search completed in 0.002 seconds

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.

AT&T Labs Research