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!)
A137424 a(n)=C{Sum_digits(n),[n mod Sum_digits(n)]}, n>=1. 0
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 5, 20, 21, 8, 1, 10, 1, 1, 6, 10, 1, 35, 28, 1, 45, 330, 1, 4, 10, 20, 7, 56, 1, 120, 462, 220, 1, 5, 1, 7, 70, 1, 210, 165, 1, 286, 1, 20, 35, 56, 1, 252, 11, 220, 1716, 364, 1, 21, 28, 1, 210, 11, 924, 78, 91, 5005, 1, 8, 1, 120, 165, 220, 78 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,11

LINKS

Table of n, a(n) for n=0..75.

MAPLE

P:=proc(n) local a, k, i; for i from 1 by 1 to n do a:=0; k:=i; while k>0 do a:=a+(k mod 10); k:=trunc(k/10); od; k:=binomial(a, (i mod a)); print(k); od; end: P(101);

CROSSREFS

Cf. A070635, A110366.

Sequence in context: A336398 A209337 A243004 * A083007 A309845 A002987

Adjacent sequences:  A137421 A137422 A137423 * A137425 A137426 A137427

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava and Giorgio Balzarotti, Apr 17 2008

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 September 24 23:43 EDT 2022. Contains 356951 sequences. (Running on oeis4.)