Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026338
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026338
%S A026338 1,1,2,3,2,4,3,5,6,4,7,8,5,6,9,10,7,11,8,12,13,14,9,15,10,16,
%T A026338 17,11,18,19,12,13,20,14,21,22,15,23,24,16,17,25,26,18,27,19,
%U A026338 28,29,30,20,31,32,21,33,22,34,35,23,24,36,37,38,39,25,26,40
%N A026338 a(n) = a(m) if a(m) has already occurred exactly once and n = m+[ m/2 
               ]+1, else a(n) = least positive integer that has not yet occurred.
%Y A026338 Sequence in context: A026400 A026409 A085238 this_sequence A026242 A130526 
               A134834
%Y A026338 Adjacent sequences: A026335 A026336 A026337 this_sequence A026339 A026340 
               A026341
%K A026338 nonn
%O A026338 1,3
%A A026338 Clark Kimberling (ck6(AT)evansville.edu)

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research