Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026350
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026350
%S A026350 1,2,2,3,4,3,5,4,6,7,5,8,9,6,10,7,11,12,8,13,9,14,15,10,16,17,
%T A026350 11,18,12,19,20,13,21,22,14,23,15,24,25,16,26,17,27,28,18,29,
%U A026350 30,19,31,20,32,33,21,34,22,35,36,23,37,38,24,39,25,40,41,26
%N A026350 a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+m-1, 
               else a(n) = least positive integer that has not yet occurred.
%Y A026350 Cf. A026272.
%Y A026350 Sequence in context: A026254 A091525 A091524 this_sequence A165634 A128282 
               A146985
%Y A026350 Adjacent sequences: A026347 A026348 A026349 this_sequence A026351 A026352 
               A026353
%K A026350 nonn
%O A026350 1,2
%A A026350 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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research