login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A296534 Integers N that yield exactly 10 different digits when all sums of two successive digits of N are considered. 1

%I #8 Nov 05 2018 18:09:49

%S 1122334455,1122334463,1122334537,1122334553,1122334627,1122334635,

%T 1122335273,1122335281,1122335437,1122335461,1122335527,1122335543,

%U 1122336173,1122336255,1122336435,1122336443,1122337081,1122337163,1122337253,1122337261,1122342637,1122342645,1122342719,1122342735,1122342809,1122342817,1122344273,1122344281,1122344519,1122344551

%N Integers N that yield exactly 10 different digits when all sums of two successive digits of N are considered.

%C The only integers with this property are 10-digit integers or 11-digit integers.

%C There are 203220 10-digit integers, the smallest one being 1122334455 and the largest one 9906140021.

%C There are 117919 11-digit integers, the smallest one being 10021324354 and the largest one 90715031100.

%H Lars Blomberg, <a href="/A296534/b296534.txt">Table of n, a(n) for n = 1..10000</a>

%e The first term is 1122334455. The successive sums of two contiguous digits of 1122334455 are 1+1=2, 1+2=3, 2+2=4, 2+3=5, 3+3=6, 3+4=7, 4+4=8, 4+5=9, 5+5=10. We see that 2, 3, 4, 5, 6, 7, 8, 9 and 10 include all digits 0 to 9, none being repeated.

%K nonn,base,fini

%O 1,1

%A _Eric Angelini_ and _Lars Blomberg_, Dec 15 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)