login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131364 Number of partitions of n into distinct repdigits of digits of n. 6
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0

COMMENTS

a(A131365(n)) = 0; a(A131366(n)) > 0;

a(A131367(n)) = n and a(m) <> n for m < A131367(n).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Eric Weisstein's World of Mathematics, Repdigit

EXAMPLE

a(11) = #{11} = 1;

a(12) = #{11+1} = 1;

a(22) = #{22} = 1;

a(24) = #{22+2} = 1;

a(197) = #{111+77+9, 99+77+11+9+1} = 2;

a(198) = #{99+88+11} = 1.

PROG

(Haskell)

a131364 n = p [r | r <- tail a010785_list, head (show r) `elem` show n] n

   where p _      0 = 1

         p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

-- Reinhard Zumkeller, Dec 10 2011

CROSSREFS

Cf. A131361, A088670.

Sequence in context: A136522 A188641 A086299 * A152066 A334946 A225595

Adjacent sequences:  A131361 A131362 A131363 * A131365 A131366 A131367

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Jul 03 2007, Jul 20 2007

EXTENSIONS

a(0)=1 added and offset adjusted by Reinhard Zumkeller, Dec 10 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 00:58 EDT 2021. Contains 347577 sequences. (Running on oeis4.)