Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026474
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026474
%S A026474 1,2,4,8,15,22,29,36,43,50,57,64,71,78,85,92,99,106,113,120,127,134,
%T A026474 141,148,155,162,169,176,183,190,197,204,211,218,225,232,239,246,253,
%U A026474 260,267,274,281,288,295,302,309,316,323,330,337,344,351,358,365,372
%N A026474 a(n) = least positive integer > a(n-1) and not equal to a(i)+a(j) or 
               a(i)+a(j)+a(k) for 1<=i<j<k<n (a 3-Stohr sequence).
%C A026474 All h-Stohr sequences have formula: h terms 1,2,..,2^(n-1),..,2^(h-1) 
               and then continue (2^h-1)(n-h)+1 - Henry Bottomley (se16(AT)btinternet.com), 
               Feb 04 2000
%H A026474 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               StoehrSequence.html">Link to a section of The World of Mathematics.</
               a>
%F A026474 Starts 1, 2, 4 then the numbers 7*(n-3)+1.
%Y A026474 Cf. A026472, A026476, A033627 A051039 A051040.
%Y A026474 Sequence in context: A070008 A033623 A094398 this_sequence A082562 A159243 
               A089140
%Y A026474 Adjacent sequences: A026471 A026472 A026473 this_sequence A026475 A026476 
               A026477
%K A026474 nonn
%O A026474 1,2
%A A026474 Clark Kimberling (ck6(AT)evansville.edu)
%E A026474 More terms from Eric Weisstein (eric(AT)weisstein.com)

    
page 1

Search completed in 0.001 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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research