Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060763
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060763 Number of distinct differences between consecutive divisors (ordered by increasing magnitude) of n which are not also divisors of n. +0
8
0, 0, 1, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 2, 0, 1, 0, 1, 0, 3, 1, 1, 0, 2, 1, 3, 1, 1, 1, 1, 0, 3, 1, 3, 0, 1, 1, 3, 1, 1, 0, 1, 1, 4, 1, 1, 0, 2, 2, 3, 1, 1, 0, 3, 2, 3, 1, 1, 0, 1, 1, 4, 0, 3, 1, 1, 1, 3, 3, 1, 0, 1, 1, 3, 1, 3, 1, 1, 2, 4, 1, 1, 1, 3, 1, 3, 1, 1, 1, 2, 1, 3, 1, 3, 0, 1, 2, 4, 0, 1, 1, 1, 1, 5 (list; graph; listen)
OFFSET

1,9

EXAMPLE

For n=70, divisors={1,2,5,7,10,14,35,70}; differences={1,3,2,3,4,21,35}; the differences {3,4,21} are not divisors, so a(70)=3.

MATHEMATICA

a[n_] := Length[Complement[Drop[d=Divisors[n], 1]-Drop[d, -1], d]]

CROSSREFS

Cf. A060682, A060738, A060764.

Sequence in context: A104234 A037870 A026920 this_sequence A131576 A100073 A075685

Adjacent sequences: A060760 A060761 A060762 this_sequence A060764 A060765 A060766

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 24 2001

EXTENSIONS

Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 22 2002

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research