Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081375
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081375 a(n) is the least number such that A081373[a(n)]=n. +0
2
1, 2, 6, 12, 30, 42, 72, 78, 84, 90, 190, 216, 222, 228, 234, 252, 270, 540, 546, 570, 630, 738, 744, 770, 792, 858, 900, 924, 930, 990, 1050, 1638, 1710, 1890, 1980, 2100, 2310, 2418, 2442, 2508, 2562, 2574, 2604, 2700, 2772, 2790, 2850, 2970, 3150 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

f[x_] := Count[Table[EulerPhi[j]-EulerPhi[x], {j, 1, x}], 0] t=Table[0, {50}]; Do[s=f[n]; If[s<51&&t[[s]]==0, t[[s]]=n], {n, 1, 4000}]; t

CROSSREFS

Cf. A081373, A081374, A000010, A067004, A008479.

Sequence in context: A094779 A093387 A143176 this_sequence A024701 A038199 A056267

Adjacent sequences: A081372 A081373 A081374 this_sequence A081376 A081377 A081378

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 24 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research