Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137424
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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; listen)
OFFSET

0,11

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.

Adjacent sequences: A137421 A137422 A137423 this_sequence A137425 A137426 A137427

Sequence in context: A138205 A137224 A091232 this_sequence A083007 A002987 A063872

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Apr 17 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research