login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088376 Numbers n such that n divides the concatenation of all divisors of n in ascending order other than 1 and n itself. 0
8, 75, 1875, 3267, 5625, 46875 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a{2}=75 because the divisors of 75 are 1, 3, 5, 15, 25 and 75, excluding 1 and 75 and concatenating in ascending order yields 351525 which is divisible by 75 (351525/75 = 4687).

MAPLE

divisorCat := proc(upLim, timeLimit, dvc) local s, m, n, d, t, f, startTime, startSet; startTime := time(); s := dvc[1]; m := dvc[2]; for n from s to upLim while time()-startTime<timeLimit do; d := divisors(n); d := d minus {1, n}; if d<>{} then t := ""; for f in d do; t := sprintf("%s%d", t, f); od; if parse(t) mod n = 0 then m := m union {n}; print(n, d, t, parse(t)/n); fi; fi; if n mod 10000=0 then printf("%10.4f secs ... testing %d ", time()-startTime, n) fi; od; [n-1, m]; end;

CROSSREFS

Sequence in context: A067306 A071720 A111685 * A096293 A083234 A144851

Adjacent sequences:  A088373 A088374 A088375 * A088377 A088378 A088379

KEYWORD

base,nonn

AUTHOR

Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 07 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.