Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086958 m such that A086956(m)=n and A086956(k)=n for exactly one k<m (k=A086957(n)). +0
9
2, 6, 12, 20, 10, 30, 14, 40, 45, 60, 22, 84, 26, 42, 90, 80, 34, 126, 38, 120, 147, 66, 46, 216, 150, 78, 135, 224, 58, 210, 62, 160, 132, 102, 245, 324, 74, 114, 156, 320, 82, 336, 86, 220, 315, 138, 94, 432, 98, 300, 204, 260, 106, 540, 110, 448, 228, 174 (list; graph; listen)
OFFSET

1,1

COMMENT

A086957(n) < a(n) < A086959(n), A086956(a(n))=A086956(A086957(n))=A086956(A086959(n));

n and A086956(n) are divisors of a(n);

A086960(A086957(n)) = a(n), A086960(a(n)) = A086959(n);

A086961(a(n)) = A086957(n), A086961(A086959(n)) = a(n);

A086962(a(n)) = A086959(n), A086962(A086959(n)) = a(n);

A086963(a(n)) = a(n);

A086964(A086957(n)) = a(n), A086964(a(n)) = A086957(n).

CROSSREFS

Cf. A086938, A086939.

Sequence in context: A104969 A065005 A139084 this_sequence A130492 A152222 A139082

Adjacent sequences: A086955 A086956 A086957 this_sequence A086959 A086960 A086961

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 25 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research