A121866 -id:A121866 - cp's OEIS frontend

A121863 See Comments lines for definition.

16, 50, 304, 93032, 17310371214, 1498244757849709540196, 3363165974015385428987990761994364730059919325224645845292529932

Offset: 4

N. J. A. Sloane, Aug 31 2006, corrected Sep 05 2006

Let "N_b" denote "N read in base b" and let "N" denote "N written in base 10" (as in normal life). The sequence is given by 16, 32_16, 64_(32_16), 128_(64_(32_16)), etc., or in other words
......16....32.....64....128.......etc.
..............16.....32.....64.........
.......................16.....32.......
................................16.....
where the subscripts are evaluated from the bottom upwards.
More precisely, "N_b" means "Take decimal expansion of N and evaluate it as if it were a base-b expansion".
The next term is too large to include.
A "dungeon" of numbers.

			64_(32_16) = 64_(3*16 + 2) = 64_50 = 6*50 + 4 = 304.

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.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, arXiv:math/0611293 [math.NT], 2006-2007.
David Applegate, Marc LeBrun, N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

Cf. A121864, A121263, A121266, A121264, A121265, A121295, A121296, A111050, A121866, A122030.

rebase(n,bas)={ local(resul,i) ; resul= n % 10 ; i=1 ; while(n>0, n = n \10 ; resul += (n%10)*bas^i ; i++ ; ) ; return(resul) ; } { a=16 ; print(a) ; for(n=5,12, a=2^n ; forstep(j=n,5,-1, a=rebase(2^(j-1),a) ; ) ; print1(a,",") ; ) ; } \\ R. J. Mathar, Sep 01 2006

Corrected and extended by R. J. Mathar, Sep 01 2006

A121864 See Comments lines for definition.

Original entry on oeis.org

16, 50, 406, 1258008, 25465014649108, 208080288305986199465852412572946560

Offset: 4

N. J. A. Sloane, Aug 31 2006, corrected Sep 05 2006

Let "N_b" denote "N read in base b" and let "N" denote "N written in base 10" (as in normal life). The sequence is given by 16, 32_16, (64_32)_16, ((128_64)_32)_16, etc., or in other words
......16....32.....64....128.......etc.
..............16.....32.....64.........
.......................16.....32.......
................................16.....
where the subscripts are evaluated from the top downwards
More precisely, "N_b" means "Take decimal expansion of N and evaluate it as if it were a base-b expansion".
The next term is too large to include.
A "dungeon" of numbers.

			(64_32)_16 = (6*32 + 4)_16 = 196_16 = 1*256 + 9*16 + 6 = 406.

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.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, arXiv:math/0611293 [math.NT], 2006-2007.
David Applegate, Marc LeBrun, N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

Cf. A121863, A121263, A121266, A121264, A121265, A121295, A121296, A111050, A121866, A122029, A122030.

A122030 See Comments lines for definition.

Original entry on oeis.org

16, 38, 200, 2324, 1189028, 4996371438596, 54444310605180563002616118404, 1333929961635427338189657222796065386478968915403224556066936061387348857093217691444

Offset: 4

N. J. A. Sloane, Aug 31 2006

Let "N_b" denote "N read in base b" and let "N" denote "N written in base 10" (as in normal life). The sequence is given by 16, 16_32, 16_(32_64), 16_(32_(64_128)), etc., or in other words
......16....16.....16.....16.......etc.
..............32.....32.....32.........
.......................64.....64.......
................................128....
where the subscripts are evaluated from the bottom upwards
More precisely, "N_b" means "Take decimal expansion of N and evaluate it as if it were a base-b expansion".
The next term is too large to include.
A "dungeon" of numbers.

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.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, arXiv:math/0611293 [math.NT], 2006-2007.
David Applegate, Marc LeBrun, N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

Cf. A121863, A121263, A121266, A121264, A121265, A121295, A121296, A111050, A121866, A121864.

A122029 See Comments lines for definition.

Original entry on oeis.org

16, 38, 200, 32768, 12918916616, 1242818253229988572210659846, 1900850177472859316749829932381453683166126327573485314289555274100802310696341510

Offset: 4

N. J. A. Sloane, Aug 31 2006

Let "N_b" denote "N read in base b" and let "N" denote "N written in base 10" (as in normal life). The sequence is given by 16, 16_32, (16_32)_64, ((16_32)_64)_128, etc., or in other words
......16....16.....16.....16.......etc.
..............32.....32.....32.........
.......................64.....64.......
................................128....
where the subscripts are evaluated from the top downwards
More precisely, "N_b" means "Take decimal expansion of N and evaluate it as if it were a base-b expansion".
The next term is too large to include.
A "dungeon" of numbers.

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.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, arXiv:math/0611293 [math.NT], 2006-2007.
David Applegate, Marc LeBrun, N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

Cf. A121863, A121263, A121266, A121264, A121265, A121295, A121296, A111050, A121866, A121864.

rebase(n,bas)={ local(resul,i) ; resul= n % 10 ; i=1 ; while(n>0, n = n \10 ; resul += (n%10)*bas^i ; i++ ; ) ; return(resul) ; } { a=16 ; for(p=5,10, print(a) ; a=rebase(a,2^p) ; ) ; } \\ R. J. Mathar, Sep 01 2006

Corrected and extended by R. J. Mathar, Sep 01 2006

cp's OEIS Frontend

A121863 See Comments lines for definition.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Extensions

A121864 See Comments lines for definition.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A122030 See Comments lines for definition.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A122029 See Comments lines for definition.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

PARI

Extensions