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!)
A075537 a(1)=1, a(2)=2, then use "merge and minus": a(n)=merge(a(n-2),a(n-1))-a(n-2)-a(n-1). 1
1, 2, 9, 18, 891, 17982, 89099109, 1798199982018, 890991089999910900891, 1798199982017999999998201800017982, 8909910899999109008909999999999999109008910000089099109 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A rapidly growing sequence. An even more rapidly growing sequence with "merge and minus" rule is A075538.
LINKS
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; a(4)=18 because a(2)=2, a(3)=9 and a(4)=merge(a(2), a(3))-a(2)-a(3)=29-2-9=18.
MATHEMATICA
se={1, 2}; a=1; b=2; Do[ab=ToExpression[ToString[a]<>ToString[b]]-a-b; se=Append[se, ab]; a=b; b=ab, {i, 10}]; se
CROSSREFS
Cf. A075538.
Sequence in context: A006226 A109298 A297470 * A342473 A342619 A342471
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 March 19 03:33 EDT 2024. Contains 370952 sequences. (Running on oeis4.)