Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147828
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147828 Minimum number k for which the digital sum of k*n is 8n. +0
3
0, 8, 44, 233, 1997, 17999, 83333, 571427 (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=8*n then ok:=0; print(j); fi; od; od; end: P(100);

CROSSREFS

A147822-A147827, A147829-A147831

Sequence in context: A125318 A000373 A082762 this_sequence A155604 A126476 A112908

Adjacent sequences: A147825 A147826 A147827 this_sequence A147829 A147830 A147831

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research