Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147831
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147831 Minimum number k for which the digital sum of k*n is 11n. +0
10
0, 29, 299, 2333, 49997, 1199999 (list; graph; listen)
OFFSET

0,2

MAPLE

P:=proc(i) local j, k, n, ok, w; for n from 0 by 1 to i do j:=-1; ok:=1; while ok=1 do j:=j+1; w:=0; k:=n*j; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if w=11*n then ok:=0; print(j); fi; od; od; end: P(100);

CROSSREFS

A147822-A147830

Sequence in context: A126550 A146015 A163708 this_sequence A165616 A142380 A042632

Adjacent sequences: A147828 A147829 A147830 this_sequence A147832 A147833 A147834

KEYWORD

easy,nonn,base,new

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Nov 14 2008

EXTENSIONS

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Nov 01 2009

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research