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.

A119797 Numbers m such that m and m+1 have the same number of distinct digits in decimal representation.

This page as a plain text file.
%I A119797 #13 Sep 19 2024 14:40:57
%S A119797 0,1,2,3,4,5,6,7,8,12,13,14,15,16,17,18,19,20,23,24,25,26,27,28,29,30,
%T A119797 31,34,35,36,37,38,39,40,41,42,45,46,47,48,49,50,51,52,53,56,57,58,59,
%U A119797 60,61,62,63,64,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86
%N A119797 Numbers m such that m and m+1 have the same number of distinct digits in decimal representation.
%C A119797 A043537(a(n)) = A043537(a(n)+1).
%H A119797 Reinhard Zumkeller, <a href="/A119797/b119797.txt">Table of n, a(n) for n = 1..10000</a>
%t A119797 Select[Range[0,86],CountDistinct[IntegerDigits[#]]==CountDistinct[IntegerDigits[#+1]]&] (* _James C. McMahon_, Sep 18 2024 *)
%o A119797 (Haskell)
%o A119797 a119797 n = a119797_list !! (n-1)
%o A119797 a119797_list = f [0..] a043537_list where
%o A119797    f (u:us) (v:vs@(v':_)) | v /= v'   = f us vs
%o A119797                           | otherwise = u : f us vs
%o A119797 -- _Reinhard Zumkeller_, Jan 04 2012
%Y A119797 Cf. A119798, A119799.
%K A119797 nonn,base
%O A119797 1,3
%A A119797 _Reinhard Zumkeller_, May 25 2006
%E A119797 Offset fixed by _Reinhard Zumkeller_, Jan 04 2012