The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075538 a(1)=1, a(2)=2, then use "merge and minus": a(n)=merge(a(1),...,a(n-1))-a(1)-...-a(n-1). 1
1, 2, 9, 117, 128988, 129116999871, 129117128987999999870883, 129117128988129116999870999999999999870882871012, 129117128988129116999871129117128987999999870882999999999999999999999999870882871011870883000129 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A rapidly growing sequence.
LINKS
FORMULA
a(1)=1, a(2)=2, a(n)=merge(a(1), ..., a(n-1))-a(1)-...-a(n-1).
EXAMPLE
a(3)=9 because a(1)=1,a(2)=2 and a(3)=merge(a(1),a(2))-a(1)-a(2)=12-1-2=9; then a(4)=117 because a(4)=merge(a(1),a(2),a(3))-a(1)-a(2)-a(3)=129-1-2-9=117.
MATHEMATICA
se={1, 2}; a=1; b=2; me=ToString[a]<>ToString[b]; su=a+b; Do[ab=ToExpression[me]-su; se=Append[se, ab]; su=su+ab; me=ToString[me]<>ToString[ab], {i, 10}]; se
CROSSREFS
Cf. A075537.
Sequence in context: A039718 A307249 A201381 * A067965 A237999 A194017
KEYWORD
nonn
AUTHOR
Zak Seidov, Sep 20 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 04:41 EDT 2024. Contains 372758 sequences. (Running on oeis4.)