Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087467
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A087467
%S A087467 1,1,2,1,2,1,3,2,1,3,2,4,1,3,2,4,1,3,5,2,4,1,3,5,2,4,6,1,3,5,2,4,6,1,3,
%T A087467 5,7,2,4,6,1,3,5,7,2,4,6,8,1,3,5,7,2,4,6,8,1,3,5,7,9,2,4,6,8,1,3,5,7,9,
%U A087467 2,4,6,8,10,1,3,5,7,9,2,4,6,8,10,1,3,5,7,9,11,2,4,6,8,10,1,3,5,7,9,11,
               2
%N A087467 a(n) = number of the row (counting from initial row 1) of the array R 
               in A087465 that contains n.
%C A087467 A sequence that contains itself as a proper subsequence (infinitely many 
               times); that is, a fractal sequence.
%H A087467 Clark Kimberling and John E. Brown, <a href="http://www.cs.uwaterloo.ca/
               journals/JIS/index.html">Partial Complements and Transposable Dispersions</
               a>, J. Integer Seqs., Vol. 7, 2004.
%F A087467 A087466(n)+1
%e A087467 Northwest corner of R:
%e A087467 1 2 4 6 9
%e A087467 3 5 8 11 15
%e A087467 7 10 14 18 23
%e A087467 12 16 21 26 32
%e A087467 19 24 30 36 43
%e A087467 a(10)=3 because 10 is in row 3.
%Y A087467 Cf. A087465, A087466.
%Y A087467 Sequence in context: A023130 A084532 A134583 this_sequence A128118 A107456 
               A165112
%Y A087467 Adjacent sequences: A087464 A087465 A087466 this_sequence A087468 A087469 
               A087470
%K A087467 nonn
%O A087467 1,3
%A A087467 Clark Kimberling (ck6(AT)evansville.edu), Sep 09 2003

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


AT&T Labs Research