Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,3

EXAMPLE

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

MATHEMATICA

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

CROSSREFS

Cf. A000005, A060741, A060763.

Adjacent sequences: A060761 A060762 A060763 this_sequence A060765 A060766 A060767

Sequence in context: A035164 A023588 A001227 this_sequence A105149 A068307 A158946

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), 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 November 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research