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-2 of 2 results.

A286846 Zeroless pandigital (9-digit) numbers where the first three digits minus the middle three digits equals the last three digits.

Original entry on oeis.org

459173286, 459176283, 459183276, 459186273, 459273186, 459276183, 459283176, 459286173, 468173295, 468175293, 468193275, 468195273, 468273195, 468275193, 468293175, 468295173, 486127359, 486129357, 486157329, 486159327, 486327159, 486329157, 486357129
Offset: 1

Views

Author

Jonathan Schwartz, Aug 01 2017

Keywords

Examples

			459173286: 459 - 173 = 286.
		

Crossrefs

A subsequence of A290725.

Programs

  • Java
    import java.util.*; public class GenerateSequence {public static void main(String[] args) { Set seq = new TreeSet(); for (long i = 123456789l; i < 987654321; i++) {Set set = new HashSet(); String number = Long.toString(i);if (!(number.contains("0"))) {for (int n = 0; n < 9; n++){set.add(number.charAt(n));} if (set.size() == 9) {if (Integer.valueOf(number.substring(0, 3)) - Integer.valueOf(number.substring(3, 6)) == Integer.valueOf(number.substring(6, 9))) { seq.add(i);} } } System.out.println(seq); } }
    
  • Mathematica
    FromDigits/@Select[Permutations[Range[9]],FromDigits[Take[#,3]]-FromDigits[ Take[ #,{4,6}]]==FromDigits[Take[#,-3]]&] (* Harvey P. Dale, Aug 08 2020 *)
  • Python
    from itertools import permutations
    def t2i(t): return int("".join(map(str, t)))
    alst = [t2i(p) for p in permutations(range(1, 10)) if t2i(p[:3]) - t2i(p[3:6]) == t2i(p[6:])]
    print(alst) # Michael S. Branicky, May 30 2022

A289552 Zeroless pandigital numbers (each digit 1-9 used exactly once) where the first 3 digits plus the next 3 digits equals the last 3 digits.

Original entry on oeis.org

124659783, 125739864, 127359486, 127368495, 128367495, 128439567, 129357486, 129438567, 129654783, 129735864, 134658792, 135729864, 138429567, 138654792, 139428567, 139725864, 142596738, 142695837, 143586729, 145692837, 146583729, 146592738, 152487639, 152784936
Offset: 1

Views

Author

Jonathan Schwartz, Aug 02 2017

Keywords

Examples

			124659783: 124 + 659 = 783.
		

Crossrefs

Programs

  • Java
    import java.util.*;public class Sequence{public static void main(String[] args) {
    for (long i = 123456789l; i < 987654321l; i++)
    {Set set = new HashSet();String number = Long.toString(i);
    if (!(number.contains("0"))) {
    for (int n = 0; n < 9; n++) {set.add(number.charAt(n));}
    if (set.size() == 9){
    if(Integer.valueOf(number.substring(0,3))+Integer.valueOf(number.substring(3,6))==Integer.valueOf(number.substring(6,9)))
    {System.out.print(i + ", ");}}}}}}
    
  • Mathematica
    FromDigits/@Select[Permutations[Range[9]],FromDigits[Take[#,3]]+FromDigits[ Take[ #,{4,6}]] == FromDigits[Take[#,-3]]&] (* Harvey P. Dale, Oct 18 2022 *)
  • Python
    from itertools import permutations
    def t2i(t): return int("".join(map(str, t)))
    alst = [t2i(p) for p in permutations(range(1, 10)) if t2i(p[:3]) + t2i(p[3:6]) == t2i(p[6:])]
    print(alst) # Michael S. Branicky, May 30 2022
Showing 1-2 of 2 results.