|
|
A267649
|
|
a(1) = a(2) = 2 then a(n) = 4 for n>2.
|
|
0
|
|
|
2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Decimal expansion of 101/450.
Also list of smallest n-composites.
A hyperoperator aggregation b[n]c is n-composite if b,c are positive non-right-identity elements.
The identity elements are:
Hyper-0 (zeration): none.
Hyper-1 (addition): 0.
Hyper-2 (multiplication): 1.
Hyper-3 (exponentiation): 1.
Hyper-n (n>2): 1.
For more information on hyperoperations see A054871.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a[n]b where a,b are the positive smallest non-right-identity elements.
|
|
EXAMPLE
|
a(0) = 2 because 1 is the smallest non-identity element in zeration and 1[0]1=2;
a(1) = 2 because 1 is the smallest non-identity element in addition and 1[1]1=2;
a(2) = 4 because 2 is the smallest non-identity element in multiplication and 2[2]2=4;
a(3) = 4 because 2 is the smallest non-identity element in exponentiation and 2[2]2=4;
a(4) = 4 because 2 is the smallest non-identity element in titration and 2[2]2=4;
Etc.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|