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.

User: Osama Abuajamieh

Osama Abuajamieh's wiki page.

Osama Abuajamieh has authored 5 sequences.

A281290 Primes p where the difference between the largest digit of p and sum of all other digits equals 4.

Original entry on oeis.org

37, 59, 73, 127, 149, 239, 271, 293, 307, 419, 491, 509, 941, 1049, 1061, 1117, 1171, 1193, 1229, 1319, 1409, 1601, 1913, 1931, 2017, 2039, 2129, 2309, 2903, 3119, 3191, 3209, 3911, 4019, 4091, 5009, 6011, 6101, 9041, 9203, 9221, 9311, 10061, 10139, 10193
Offset: 1

Views

Author

Osama Abuajamieh, Jan 19 2017

Keywords

Examples

			37 is a term since 7 - 3 = 4.
9221 is a term, since 9 - (2 + 2 + 1) = 4.

Links

Crossrefs

A subsequence of A280915.
Cf. A000040.

Programs

  • Mathematica
    Select[Prime@ Range[10^3], Fold[#1 - #2 &, First@ #, Rest@ #] == 4 &@ Reverse@ Sort@ IntegerDigits@ # &] (* Michael De Vlieger, Feb 08 2017 *)
  • PARI
    is(n)=my(d=digits(n)); 2*vecmax(d)==vecsum(d)+4 && isprime(n) \\ Charles R Greathouse IV, Feb 18 2017
  • PARI
    do(d)=my(v=List()); for(len=1,d, for(b=5,9, for(e=0,len-1, my(t=b*10^e,n,dig); forvec(u=vector(b-4,i,[0,len-1]), n=t+sum(i=1,#u,10^u[i]); if(!isprime(n), next); dig=digits(n); if(2*vecmax(dig)==vecsum(dig)+4, listput(v,n)), 1)))); Set(v) \\ Charles R Greathouse IV, Feb 18 2017

Extensions

More terms from Lars Blomberg, Feb 18 2017

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

Original entry on oeis.org

23, 43, 67, 89, 113, 131, 157, 179, 197, 241, 263, 269, 311, 337, 359, 373, 421, 449, 461, 571, 593, 607, 641, 719, 733, 751, 809, 953, 971, 1013, 1031, 1097, 1103, 1163, 1237, 1259, 1301, 1327, 1361, 1439, 1471, 1493, 1613, 1619, 1709, 1723, 1741, 1907, 2003, 2063, 2069, 2137
Offset: 1

Views

Author

Osama Abuajamieh, Jan 18 2017

Keywords

Examples

			a(19) = 461, as 6 - (4 + 1) = 1

Links

Crossrefs

A subsequence of A280915.
Cf. A000040.

Programs

  • Mathematica
    Select[Prime@ Range[10^3], Fold[#1 - #2 &, First@ #, Rest@ #] == 1 &@ Reverse@ Sort@ IntegerDigits@ # &] (* Michael De Vlieger, Feb 08 2017 *)
ldod1Q[n_]:=Module[{idn=Sort[IntegerDigits[n]]},Last[idn]-Total[Most[ idn]] == 1]; Select[Prime[Range[400]],ldod1Q] (* Harvey P. Dale, Sep 14 2019 *)

A281170 Primes p whose decimal representation satisfy: abs(digsum(p)-2*L(p)) = 8, being L(p) the largest decimal digit in p.

Original entry on oeis.org

19, 109, 1009, 1777, 1889, 1979, 1997, 2677, 2699, 2767, 2789, 2879, 2897, 2969, 3779, 3797, 4567, 4657, 4679, 4967, 5399, 5557, 5647, 5669, 5737, 5849, 5939, 6277, 6299, 6367, 6389, 6547, 6563, 6569, 6637, 6653, 6659, 6673, 6763, 6947, 6983, 7177
Offset: 1

Views

Author

Osama Abuajamieh, Jan 16 2017

Keywords

Examples

			a(4) = 1777, since abs(digsum(1777)-2*L(1777)) = abs(A007953(1777)-2*A054055(1777)) is 8 and among the primes 1777 is the 4th element satisfying such condition.

Crossrefs

Subsequence of A280993.
Cf. A007953, A054055, A156753, A156979.

Programs

  • Mathematica
    Select[Prime@ Range[10^3], Abs[Max@ # - Total@ Rest@ #] == 8 &@ Reverse@ Sort@ IntegerDigits@ # &] (* Michael De Vlieger, Feb 02 2017 *)
  • PARI
    listA281170(k,{k0=8})={my(H=List(),y);forprime(z=prime(k0),prime(k),y=digits(z);if(abs(vecsum(y)-2*vecmax(y))==8,listput(H,z)));return(vector(#H,i,H[i]))} \\ Looks for those belonging terms between prime(k0) and prime(k). - R. J. Cano, Feb 06 2017

A280915 Primes where difference between largest digit and all other digits is a positive square.

Original entry on oeis.org

11, 23, 37, 43, 59, 67, 73, 89, 101, 113, 127, 131, 149, 157, 167, 179, 197, 211, 239, 241, 257, 263, 269, 271, 293, 307, 311, 337, 347, 359, 373, 419, 421, 431, 449, 461, 491, 509, 523, 541, 571, 593, 607, 617, 641, 719, 733, 743, 751, 761, 809, 853, 941, 953, 971, 1013, 1021, 1031
Offset: 1

Views

Author

Osama Abuajamieh, Jan 10 2017

Keywords

Comments

If the largest digit L (say) is repeated, the criterion is that that L - (sum of all digits except for one copy of L) is a square.

Examples

			Prime 1153 is in a(n) since 5-3-1-1=0. Zero is square.
Prime 1163 is in a(n) since 6-3-1-1=1. One is square.
Prime 1171 is in a(n) since 7-1-1-1=4. Four is square.

Links

Crossrefs

This sequence is a parent sequence of A156753.

Programs

  • Mathematica
    Select[Prime@ Range@ 175, IntegerQ@ Sqrt@ Fold[#1 - #2 &, Max@ #, Rest@ #] &@ Reverse@ Sort@ IntegerDigits@ # &] (* Michael De Vlieger, Feb 02 2017 *)
  • PARI
    is(n)=my(d=digits(n)); issquare(2*vecmax(d)-vecsum(d)) && isprime(n) \\ Charles R Greathouse IV, Feb 05 2017

A280993 Primes such that the absolute value of the difference between the largest digit and the sum of all the other digits is a cube.

Original entry on oeis.org

11, 19, 23, 43, 67, 89, 101, 109, 113, 131, 157, 167, 179, 197, 199, 211, 223, 241, 257, 263, 269, 311, 313, 331, 337, 347, 353, 359, 373, 379, 397, 421, 431, 449, 461, 463, 523, 541, 571, 593, 607, 617, 641, 643, 661, 683, 719, 733, 739, 743
Offset: 1

Views

Author

Osama Abuajamieh, Jan 14 2017

Keywords

Comments

If the largest digit L (say) is repeated, the criterion is that |L - (sum of all digits except for one copy of L)| is a cube.

Examples

			The prime 2731 is a term, because 7-2-3-1 = 1 is a cube.
The prime 13 is not in the sequence, as 3-1 = 2, and 2 is not a cube.
The prime 313 is a term because |3 - (1+3)| = 1 is a cube.

Links

Crossrefs

A156753 and A156979 are subsequences.

Programs

  • Mathematica
    Select[Prime[Range[150]],IntegerQ[Surd[Abs[Max[IntegerDigits[#]]-Total[ Most[ Sort[IntegerDigits[#]]]]],3]]&] (* Harvey P. Dale, Dec 31 2021 *)
  • PARI
    listA280993(k, {k0=5})={my(H=List(), y); forprime(z=prime(k0), prime(k), y=digits(z); if(ispower(abs(vecsum(y)-2*vecmax(y)),3), listput(H, z))); return(vector(#H, i, H[i]))} \\ Looks for those belonging terms between prime(k0) and prime(k). - R. J. Cano, Feb 06 2017

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.