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.

Showing 1-4 of 4 results.

A173573 3-Factorions: equal to the sum of the triple factorials of their digits in base 10.

Original entry on oeis.org

1, 2, 3, 4, 81, 82, 83, 84
Offset: 1

Views

Author

Keywords

Comments

Sequence is complete. - Giovanni Resta, Mar 21 2013

Examples

			81 -> 8!!! + 1!!! = 8*5*2 + 1 = 80 + 1 = 81.
		

Crossrefs

Programs

  • Maple
    P:=proc(n,m) local a,b,i,j,k,x,w; for i from 1 by 1 to n do a:=0; b:=0; w:=0; k:=i; while k>0 do w:=k-(trunc(k/10)*10); j:=w; x:=w-m; if w=0 then b:=1; else while x>0 do j:=j*x; x:=x-m; od; b:=j; fi; a:=a+b; k:=trunc(k/10); od; if a=i then lprint(i,a); fi; od; end: P(1000,3);
  • Mathematica
    stfQ[n_]:=n==Total[Times@@Range[#,1,-3]&/@IntegerDigits[n]]; Select[Range[100],stfQ] (* Harvey P. Dale, May 31 2023 *)

A173574 4-Factorions: equal to the sum of the quadruple factorials of their digits in base 10.

Original entry on oeis.org

1, 2, 3, 4, 5, 49
Offset: 1

Views

Author

Paolo P. Lava, Feb 22 2010

Keywords

Examples

			49 -> 4!!!! + 9!!!! = 4 + 9*5 = 4 +45 = 49.
		

Crossrefs

Programs

  • Maple
    P:=proc(n,m) local a,b,i,j,k,x,w; for i from 1 by 1 to n do a:=0; b:=0; w:=0; k:=i; while k>0 do w:=k-(trunc(k/10)*10); j:=w; x:=w-m; if w=0 then b:=1; else while x>0 do j:=j*x; x:=x-m; od; b:=j; fi; a:=a+b; k:=trunc(k/10); od; if a=i then lprint(i,a); fi; od; end: P(1000,4);
  • Mathematica
    qfd[n_]:=Times@@Range[n,1,-4]; Select[Range[50],Total[qfd/@ IntegerDigits[ #]] == #&] (* Harvey P. Dale, Dec 15 2018 *)

A173575 5-Factorions: equal to the sum of the quintuple factorials of their digits in base 10.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 39
Offset: 1

Views

Author

Keywords

Examples

			39 -> 3!!!!! + 9!!!!! = 3 + 9*4 = 3 + 36 = 39.
		

Crossrefs

Programs

  • Maple
    P:=proc(n,m) local a,b,i,j,k,x,w; for i from 1 by 1 to n do a:=0; b:=0; w:=0; k:=i; while k>0 do w:=k-(trunc(k/10)*10); j:=w; x:=w-m; if w=0 then b:=1; else while x>0 do j:=j*x; x:=x-m; od; b:=j; fi; a:=a+b; k:=trunc(k/10); od; if a=i then lprint(i,a); fi; od; end: P(1000,5);

A173576 6-Factorions: equal to the sum of the 6-ple factorials of their digits in base 10.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 29
Offset: 1

Views

Author

Paolo P. Lava, Feb 22 2010

Keywords

Examples

			29 -> 2!!!!!! + 9!!!!!! = 2 + 9*3 = 2 + 27 = 29.
		

Crossrefs

Programs

  • Maple
    P:=proc(n,m) local a,b,i,j,k,x,w; for i from 1 by 1 to n do a:=0; b:=0; w:=0; k:=i; while k>0 do w:=k-(trunc(k/10)*10); j:=w; x:=w-m; if w=0 then b:=1; else while x>0 do j:=j*x; x:=x-m; od; b:=j; fi; a:=a+b; k:=trunc(k/10); od; if a=i then lprint(i,a); fi; od; end: P(1000,6);
Showing 1-4 of 4 results.