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.

A182287 If n = p*10^i + q*10^(i-1) + r*10^(i-2) + ... in decimal notation, then a(n) = p!*10^i + q!*10^(i-1) + r!*10^(i-2)+ ... .

This page as a plain text file.
%I A182287 #34 Sep 08 2022 08:45:55
%S A182287 1,1,2,6,24,120,720,5040,40320,362880,11,11,12,16,34,130,730,5050,
%T A182287 40330,362890,21,21,22,26,44,140,740,5060,40340,362900,61,61,62,66,84,
%U A182287 180,780,5100,40380,362940,241,241,242,246,264,360,960,5280,40560,363120
%N A182287 If n = p*10^i + q*10^(i-1) + r*10^(i-2) + ... in decimal notation, then a(n) = p!*10^i + q!*10^(i-1) + r!*10^(i-2)+ ... .
%H A182287 Bruno Berselli, <a href="/A182287/b182287.txt">Table of n, a(n) for n = 0..1000</a>
%H A182287 Renzo Remotti, <a href="/A182287/a182287.pdf">Positional Factorial Sequence</a>
%e A182287 a(1)=1 because 1!*10^0=1, a(15)=130 because 1!*10^1+5!*10^0=130.
%o A182287 (Magma) [n eq 0 select 1 else &+[Factorial(Reverse(Intseq(n))[k])*10^(#Intseq(n)-k): k in [1..#Intseq(n)]]: n in [0..50]]; // _Bruno Berselli_, May 15 2012
%Y A182287 Cf. A007623, A061602.
%K A182287 nonn,base
%O A182287 0,3
%A A182287 _Renzo Remotti_, Apr 23 2012
%E A182287 Offset changed from 1 to 0 by _Bruno Berselli_, May 16 2012