Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121266
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A121266
%S A121266 10,11,11,12,13,13,13,15,16,16,14,17,19,20,20,15,19,22,24,25,25,16,
%T A121266 21,25,28,30,31,31,17,23,28,32,35,37,38,38,18,25,31,36,40,43,45,46,
%U A121266 46,19,27,34,40,45,49,52,54,55,55,20,29,37,44,50,55,59,62,64,65,65
%N A121266 Triangle read by rows: row n (n>= 10) gives n-10 successive bases used 
               in computing A121263(n) followed by A121263(n) itself.
%C A121266 Left-hand entry of row n is n, right-hand entry is A121263(n).
%C A121266 A "dungeon" of numbers.
%D A121266 David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons, 
               Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.
%D A121266 David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons 
               and Iterated Base-Changing, in "The Mathematics of Preference, Choice 
               and Order: Essays in Honor of Peter Fishburn", edited by Steven Brams, 
               William V. Gehrlein and Fred S. Roberts, Springer, 2009, pp. 393-402.
%H A121266 N. J. A. Sloane, <a href="b121266.txt">Rows 10 through 45 of triangle, 
               flattened</a>
%H A121266 David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="http://arXiv.org/
               abs/math.NT/0611293">Descending Dungeons and Iterated Base-Changing</
               a> (arXiv:math.NT/0611293).
%e A121266 Triangle begins:
%e A121266 10
%e A121266 11 11
%e A121266 12 13 13
%e A121266 13 15 16 16
%e A121266 14 17 19 20 20
%e A121266 15 19 22 24 25 25
%e A121266 16 21 25 28 30 31 31
%e A121266 17 23 28 32 35 37 38 38
%e A121266 18 25 31 36 40 43 45 46 46
%e A121266 19 27 34 40 45 49 52 54 55 55
%e A121266 20 29 37 44 50 55 59 62 64 65 65
%p A121266 M:=45; a:=list(10..M): a[10]:=10: a[10]; for n from 11 to M do b:=n; 
               lprint(b); for i from n-1 by -1 to 11 do t1:=convert(i,base,10); 
               b:=add(t1[j]*b^(j-1),j=1..nops(t1)): lprint(b); od: a[n]:=b; lprint(a[n]); 
               od:
%Y A121266 Cf. A121263.
%Y A121266 Sequence in context: A065016 A087381 A136400 this_sequence A045988 A008947 
               A108787
%Y A121266 Adjacent sequences: A121263 A121264 A121265 this_sequence A121267 A121268 
               A121269
%K A121266 nonn,tabl,base
%O A121266 10,1
%A A121266 N. J. A. Sloane (njas(AT)research.att.com), Aug 23 2006

    
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