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



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248013 Numbers m such that A247796(m) = m. 5

%I #5 Oct 08 2014 10:47:20

%S 0,1,2,3,4,5,6,7,8,9,19,28,29,37,38,39,46,47,48,49,55,56,57,58,59,64,

%T 65,66,67,68,69,73,74,75,76,77,78,79,82,83,84,85,86,87,88,89,91,92,93,

%U 94,95,96,97,98,99,191,192,193,194,195,196,197,198,199,282

%N Numbers m such that A247796(m) = m.

%C A247796(a(n)) = a(n);

%C numbers, containing no pair of adjacent digits with sum <= 9 in decimal representation.

%H Reinhard Zumkeller, <a href="/A248013/b248013.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

%o a248013 n = a248013_list !! (n-1)

%o a248013_list = filter (\x -> a247796 x == x) [0..]

%Y Cf. A248014 (complement).

%K nonn,base

%O 1,3

%A _Reinhard Zumkeller_, Oct 08 2014

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 December 9 02:18 EST 2023. Contains 367681 sequences. (Running on oeis4.)