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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052219 Numbers whose sum of digits is 5. 34
5, 14, 23, 32, 41, 50, 104, 113, 122, 131, 140, 203, 212, 221, 230, 302, 311, 320, 401, 410, 500, 1004, 1013, 1022, 1031, 1040, 1103, 1112, 1121, 1130, 1202, 1211, 1220, 1301, 1310, 1400, 2003, 2012, 2021, 2030, 2102, 2111, 2120, 2201, 2210, 2300, 3002 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A007953(a(n)) = 5; number of repdigits = #{5,11111} = A242627(5) = 2. - Reinhard Zumkeller, Jul 17 2014

LINKS

Michael S. Branicky, Table of n, a(n) for n = 1..11628 (all terms through 15 digits; terms 1..1287 from Vincenzo Librandi and T. D. Noe, terms 1..462 from Vincenzo Librandi)

MATHEMATICA

Select[Range[10^4], Total[IntegerDigits[#]] == 5 &] (* Vincenzo Librandi, Mar 07 2013 *)

Union[Flatten[Table[FromDigits /@ Permutations[PadRight[s, 9]], {s, IntegerPartitions[5]}]]] (* T. D. Noe, Mar 08 2013 *)

PROG

(Magma) [n: n in [1..3010] | &+Intseq(n) eq 5 ]; // Vincenzo Librandi, Mar 07 2013

(Haskell)

a052219 n = a052219_list !! (n-1)

a052219_list = filter ((== 5) . a007953) [0..]

-- Reinhard Zumkeller, Jul 17 2014

(PARI) isok(n) = sumdigits(n) == 5; \\ Michel Marcus, Dec 28 2015

(Python)

from sympy.utilities.iterables import multiset_permutations

def auptodigs(maxdigits):

alst = [5]

for d in range(2, maxdigits+1):

fulldigset = list("0"*(d-1) + "1111122345")

for firstdig in "12345":

target_sum, restdigset = 5-int(firstdig), fulldigset[:]

restdigset.remove(firstdig)

for p in multiset_permutations(restdigset, d-1):

if sum(map(int, p)) == target_sum:

alst.append(int(firstdig+"".join(p)))

if int(p[0]) == target_sum: break

return alst

print(auptodigs(4)) # Michael S. Branicky, May 14 2021

CROSSREFS

Cf. A007953.

Cf. A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225(14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Cf. A242614, A242627.

Sequence in context: A350996 A043473 A017221 * A044057 A147825 A174263

Adjacent sequences: A052216 A052217 A052218 * A052220 A052221 A052222

KEYWORD

nonn,base,easy

AUTHOR

Henry Bottomley, Feb 01 2000

EXTENSIONS

Offset changed from Bruno Berselli, Mar 07 2013

STATUS

approved

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 5 09:04 EST 2022. Contains 358585 sequences. (Running on oeis4.)