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!)
A178157 Numbers n that are divisible by every prefix of n. 2
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 24, 26, 28, 30, 33, 36, 39, 40, 44, 48, 50, 55, 60, 66, 70, 77, 80, 88, 90, 99, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290, 300, 330, 360, 390, 400, 420, 440, 460, 480, 500, 510, 520, 530, 540, 550, 560 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

EXAMPLE

3570 is in the sequence because :

3 | 3570 ;

35 | 3570 ;

357 | 3570 ;

3570 | 3570.

MAPLE

with(numtheory):T:=array(1..9):for n from 1 to 10000 do:ind:=0:l:=length(n):n0:=n:s:=0:for

m from 1 to l do:q:=n0:u:=irem(q, 10):v:=iquo(q, 10):n0:=v :T[m]:=u:od:for i from

1 to l do: s1:=0:for j from 0 to i-1 do: s1:=s1 + T[l-i+j+1]*10^j :od:if irem(n, s1)=0

then ind:=ind+1:else fi:od:if ind=l then printf(`%d, `, n):else fi:od:

CROSSREFS

Cf. A034837.

Sequence in context: A032520 A034837 A096105 * A246083 A246090 A175782

Adjacent sequences: A178154 A178155 A178156 * A178158 A178159 A178160

KEYWORD

nonn,base

AUTHOR

Michel Lagneau, Dec 17 2010

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 9 13:46 EST 2022. Contains 358700 sequences. (Running on oeis4.)