Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139401
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A139401
%S A139401 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,
%T A139401 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,
%U A139401 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
%N A139401 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.
%C A139401 All nonzero values in this sequence are at least 3.
%C A139401 Records of nonzero values in this sequence are in A066730
%e A139401 a(2) = 3 because there are no squares in the sequence 2, 5, 8, 11, 14, 
               17, 20...
%Y A139401 Cf. A066730.
%Y A139401 Sequence in context: A124917 A025278 A063405 this_sequence A110061 A021750 
               A086230
%Y A139401 Adjacent sequences: A139398 A139399 A139400 this_sequence A139402 A139403 
               A139404
%K A139401 nonn
%O A139401 1,2
%A A139401 J. Lowell (jhbubby(AT)mindspring.com), Jun 09 2008, Jun 10 2008
%E A139401 More terms from John W. Layman (layman(AT)math.vt.edu), Jun 17 2008

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research