Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088376
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088376 Numbers n such that n divides the concatenation of all divisors of n in ascending order other than 1 and n itself. +0
1
8, 75, 1875, 3267, 5625, 46875 (list; graph; listen)
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 this_sequence A096293 A083234 A144851

Adjacent sequences: A088373 A088374 A088375 this_sequence A088377 A088378 A088379

KEYWORD

base,nonn

AUTHOR

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

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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research