A124075
a(n) = 2^(3^(4^...^n)...).
Original entry on oeis.org
2, 8, 2417851639229258349412352
Offset: 2
a(4) = 2^(3^4) = 2417851639229258349412352.
- 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.
-
a[n_] := Fold[#2^#1&, n, Range[2, n-1] // Reverse];
Table[a[n], {n, 2, 4}] (* Jean-François Alcover, Oct 10 2018 *)
A122029
See Comments lines for definition.
Original entry on oeis.org
16, 38, 200, 32768, 12918916616, 1242818253229988572210659846, 1900850177472859316749829932381453683166126327573485314289555274100802310696341510
Offset: 4
- 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.
-
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
A121297
For definition see Comments lines.
Original entry on oeis.org
11, 14, 21, 39, 78, 211, 1954, 63163, 17163259, 316235916142, 7475840758734855197, 77068358083998565749275388634420, 56080446471298599543571746837309517827424625680076701163
Offset: 10
- 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.
-
asubb := proc(a,b) local t1; t1:=convert(a,base,10); add(t1[j]*b^(j-1),j=1..nops(t1)): end;
t1:=[10]; for n from 1 to 12 do t2:=f(t1[n],ithprime(n+5)); t1:=[op(t1),t2]; od: t1;
Comments