Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063972
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063972 a(n) is the smallest m such that usigma(m) = n (or 0 if no such m). +0
2
1, 0, 2, 3, 4, 5, 0, 7, 8, 9, 0, 6, 0, 13, 0, 0, 16, 10, 0, 12, 0, 0, 0, 14, 0, 25, 0, 27, 0, 18, 0, 21, 32, 0, 0, 22, 0, 37, 0, 28, 0, 26, 0, 43, 0, 0, 0, 33, 0, 36, 0, 0, 0, 34, 0, 39, 0, 0, 0, 38, 0, 61, 0, 0, 64, 0, 0, 48, 0, 52, 0, 30, 0, 73, 0, 0, 0, 50, 0, 57, 0, 81, 0, 54, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,3

COMMENT

usigma(m) is the sum of unitary divisors of m, A034448.

EXAMPLE

a(12)=6 because the unitary divisors of 6 are 1,2,3,6; they sum to 12.

CROSSREFS

Cf. A034444, A034448, A051444, A057637, A063973.

Sequence in context: A049265 A010875 A095874 this_sequence A063973 A126441 A004181

Adjacent sequences: A063969 A063970 A063971 this_sequence A063973 A063974 A063975

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 05 2001

EXTENSIONS

Edited by Don Reble (djr(AT)nk.ca), May 14 2006

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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research