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!)
A116301 n times n+1 gives the concatenation of two numbers m and m+2. 5
768, 859, 911, 3286, 6714, 45453, 54547, 990101, 8181820, 70588234, 343130555, 362637364, 363636362, 420053632, 421052633, 497975710, 502024290, 578947367, 579946368, 636363638, 637362636, 656869445, 706766919 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Robert Israel, Table of n, a(n) for n = 1..9000

MAPLE

As:= {}:

for m from 2 to 20 do

acands:= map(t -> rhs(op(t)), [msolve(a*(a+1)=2, 10^m+1)]);

bcands:= map(t -> t*(t+1) mod 10^m, acands);

good:= select(t -> bcands[t]>=10^(m-1), [$1..nops(acands)]);

As:= As union convert(acands[good], set);

od:

sort(convert(As, list)); # Robert Israel, Aug 20 2019

CROSSREFS

Cf. A116170, A116294, A116302, A116307.

Sequence in context: A115934 A252072 A200856 * A219225 A045082 A257414

Adjacent sequences: A116298 A116299 A116300 * A116302 A116303 A116304

KEYWORD

nonn,base

AUTHOR

Giovanni Resta, Feb 06 2006

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 February 1 08:20 EST 2023. Contains 359992 sequences. (Running on oeis4.)