Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083246
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083246 Numbers n such that at least one of the following four conditions is satisfied: 1# d[n]=r[n]; 2# d[n]=u[n]; 3# r[n]=u[n], or 4# n-u[n]=u[n], i.e. n=2.u[n]. Here d[n]=A000005[n] size of divisor-set, r[n]=A000010[n], size of RRS[n] and u[n]=A045763[m], size of unrelated set. +0
2
1, 3, 8, 10, 15, 18, 24, 25, 30, 50, 61455 (list; graph; listen)
OFFSET

1,2

COMMENT

Is this sequence finite and full?

EXAMPLE

1# d[n]=r[n] holds for {1,3,8,10,18,24,30}, see A020488;

2# d[n]=u[n] holds for {15,25};3# r[n]=u[n] holds for {61455};

4# n-u[n]=u[n] holds for {30,50}. No more cases below 10^7.

{n,d,r,u} values for 11 initial terms are as follows:

{1, 1, 1, 0}, {3, 2, 2, 0}, {8, 4, 4, 1}, {10, 4, 4, 3}, {15, 4, 8, 4}, {18, 6, 6, 7}{24, 8, 8, 9}, {25, 3, 20, 3}, {30, 8, 8, 15}, {50, 6, 20, 25}, {61455, 16, 30720, 30720}.

MATHEMATICA

Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; If[Equal[d, r]||Equal[d, u]||Equal[r, u]||Equal[u, n-u], Print[n(*, {d, r, u}*)]], {n, 1, 10000000}]

CROSSREFS

Cf. A000005, A000010, A045763, A073757, A083243, A083244, A083246, A020488.

Sequence in context: A003038 A073547 A047356 this_sequence A023492 A022801 A128699

Adjacent sequences: A083243 A083244 A083245 this_sequence A083247 A083248 A083249

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research