A157532 a(1) = 2; for n > 1, a(n) = 3.
2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
Offset: 1
Examples
a(4) = 1[0]1[1]1[2]1[3]1[4]1 = '1+1*1^1^^1 = 3. - _Natan Arie Consigli_, May 02 2015
Links
- Index entries for linear recurrences with constant coefficients, signature (1).
Crossrefs
Programs
-
Mathematica
{2}~Join~Table[3, {120}] (* Michael De Vlieger, May 05 2015 *) PadRight[{2},120,3] (* Harvey P. Dale, Aug 12 2021 *)
-
PARI
A157532(n)=2+(n>1) \\ M. F. Hasler, Jul 30 2015
Formula
a(n) = 1[0]1[1]1...1[n-1]1[n]1, where [0] is zeration or successor (y[0]x = x+1), [1] addition, [2] multiplication, [3] exponentiation, [4] repeated exponentiation, etc. - Natan Arie Consigli, May 02 2015
G.f.: x*(2+x)/(1-x). - Robert Israel, May 07 2015
Extensions
More threes from R. J. Mathar, Mar 14 2009; truncated to three lines by M. F. Hasler, Jul 30 2015
Comments