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.

A281226 Primes p where largest digit of p minus sum of all other digits is equal to 1.

This page as a plain text file.
%I A281226 #25 Sep 14 2019 10:13:37
%S A281226 23,43,67,89,113,131,157,179,197,241,263,269,311,337,359,373,421,449,
%T A281226 461,571,593,607,641,719,733,751,809,953,971,1013,1031,1097,1103,1163,
%U A281226 1237,1259,1301,1327,1361,1439,1471,1493,1613,1619,1709,1723,1741,1907,2003,2063,2069,2137
%N A281226 Primes p where largest digit of p minus sum of all other digits is equal to 1.
%H A281226 Harvey P. Dale, <a href="/A281226/b281226.txt">Table of n, a(n) for n = 1..1000</a>
%e A281226 a(19) = 461, as 6 - (4 + 1) = 1
%t A281226 Select[Prime@ Range[10^3], Fold[#1 - #2 &, First@ #, Rest@ #] == 1 &@ Reverse@ Sort@ IntegerDigits@ # &] (* _Michael De Vlieger_, Feb 08 2017 *)
%t A281226 ldod1Q[n_]:=Module[{idn=Sort[IntegerDigits[n]]},Last[idn]-Total[Most[ idn]] == 1]; Select[Prime[Range[400]],ldod1Q] (* _Harvey P. Dale_, Sep 14 2019 *)
%Y A281226 A subsequence of A280915.
%Y A281226 Cf. A000040.
%K A281226 nonn,base
%O A281226 1,1
%A A281226 _Osama Abuajamieh_, Jan 18 2017