A289552 -id:A289552 - 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.

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

Jonathan Schwartz, Aug 01 2017

			459173286: 459 - 173 = 286.

Jonathan Schwartz, Table of n, a(n) for n = 1..336
David A. Corneth, PARI program

Cf. A050289, A286845, A289544, A289552.

A subsequence of A290725.

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); } }

FromDigits/@Select[Permutations[Range[9]],FromDigits[Take[#,3]]-FromDigits[ Take[ #,{4,6}]]==FromDigits[Take[#,-3]]&] (* Harvey P. Dale, Aug 08 2020 *)

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

A289544 Pandigital numbers (each digit 0-9 used exactly once) where the first 3 digits plus the next 3 digits equals the last 4 digits.

Original entry on oeis.org

2467891035, 2497861035, 2647891053, 2697841053, 2847691053, 2867491035, 2897461035, 2897641053, 3247651089, 3257641089, 3427561098, 3467521098, 3478591206, 3498571206, 3527461098, 3567421098, 3578491206, 3598471206, 3647251089, 3657241089, 4236751098, 4256731098

Offset: 1

Jonathan Schwartz, Aug 02 2017

Leading zeros in the last four digits are not included, else 1246590783, with 124 + 659 = 783 would be the first term.

			2467891035 is in the sequence as 246|789|1035: 246 + 789 = 1035 and each digit (0-9) is used exactly once.

Jonathan Schwartz, Table of n, a(n) for n = 1..96
David A. Corneth, PARI program

Cf. A050278, A289552, A286846.

FromDigits /@ Select[Permutations[Range[0, 9]], And[#1 + #2 == #3, #3 >= 1000] & @@ Map[FromDigits, {Take[#, 3], #[[4 ;; 6]], Take[#, -4]}] &] (* Michael De Vlieger, Aug 02 2018 *)

from itertools import permutations
def t2i(t): return int("".join(map(str, t)))
alst = [t2i(p) for p in permutations(range(10)) if p[6] != 0 and t2i(p[:3]) + t2i(p[3:6]) == t2i(p[6:])]
print(alst) # Michael S. Branicky, May 30 2022

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.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Java

Mathematica

Python