cp's OEIS Frontend

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

%I A286846 #31 May 31 2022 13:11:42
%S A286846 459173286,459176283,459183276,459186273,459273186,459276183,
%T A286846 459283176,459286173,468173295,468175293,468193275,468195273,
%U A286846 468273195,468275193,468293175,468295173,486127359,486129357,486157329,486159327,486327159,486329157,486357129
%N A286846 Zeroless pandigital (9-digit) numbers where the first three digits minus the middle three digits equals the last three digits.
%H A286846 Jonathan Schwartz, <a href="/A286846/b286846.txt">Table of n, a(n) for n = 1..336</a>
%H A286846 David A. Corneth, <a href="/A286846/a286846_1.gp.txt">PARI program</a>
%e A286846 459173286: 459 - 173 = 286.
%t A286846 FromDigits/@Select[Permutations[Range[9]],FromDigits[Take[#,3]]-FromDigits[ Take[ #,{4,6}]]==FromDigits[Take[#,-3]]&] (* _Harvey P. Dale_, Aug 08 2020 *)
%o A286846 (Java) import java.util.*; public class GenerateSequence {public static void main(String[] args) { Set<Integer> seq = new TreeSet<Integer>(); for (long i = 123456789l; i < 987654321; i++) {Set<Character> set = new HashSet<Character>(); 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); } }
%o A286846 (Python)
%o A286846 from itertools import permutations
%o A286846 def t2i(t): return int("".join(map(str, t)))
%o A286846 alst = [t2i(p) for p in permutations(range(1, 10)) if t2i(p[:3]) - t2i(p[3:6]) == t2i(p[6:])]
%o A286846 print(alst) # _Michael S. Branicky_, May 30 2022
%Y A286846 Cf. A050289, A286845, A289544, A289552.
%Y A286846 A subsequence of A290725.
%K A286846 nonn,base,fini,full
%O A286846 1,1
%A A286846 _Jonathan Schwartz_, Aug 01 2017