cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A095249 Reverse concatenation of first n positive integers modulo forward concatenation of first n positive integers.

This page as a plain text file.
%I A095249 #16 Nov 19 2018 11:14:29
%S A095249 0,9,75,619,4941,37041,246919,1234575,9,10987654321,1110987654321,
%T A095249 121110987654321,775432077543108,178553219976533007,
%U A095249 27956332009875522906,3805734210999774512805,481583522109989673502704,58259362312008979572492603,6836037241301907969471482502
%N A095249 Reverse concatenation of first n positive integers modulo forward concatenation of first n positive integers.
%H A095249 Vincenzo Librandi, <a href="/A095249/b095249.txt">Table of n, a(n) for n = 1..375</a>
%F A095249 a(n) = A000422(n) mod A007908(n). - _Michel Marcus_, Nov 19 2018
%e A095249 a(4) = 619 = 4321 mod 1234.
%p A095249 a:= n-> irem(parse(cat(n-i$i=0..n-1)), parse(cat(i$i=1..n))):
%p A095249 seq(a(n), n=1..20);  # _Alois P. Heinz_, Nov 19 2018
%t A095249 r = f = ""; Do[r = ToString[n] <> r; f = f <> ToString[n]; Print[Mod[ToExpression[r], ToExpression[f]]], {n, 1, 30}] (* _Ryan Propper_, Aug 26 2005 *)
%t A095249 nn=30;Module[{r,f},Table[f=Flatten[IntegerDigits/@Range[n]]; r=Flatten[ IntegerDigits/@Range[n,1,-1]];Mod[FromDigits[r],FromDigits[f]],{n,nn}]] (* _Harvey P. Dale_, Mar 04 2013 *)
%Y A095249 Cf. A000422, A007908.
%K A095249 base,nonn
%O A095249 1,2
%A A095249 _Amarnath Murthy_, Jun 17 2004
%E A095249 Corrected and extended by _Ryan Propper_, Aug 26 2005