Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063534
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063534 C(n)=H(n)+d(n), where C(n) is Chowla's function A048050, H(n) is the half-totient function A023022 and d(n) is the number of divisors function A000005. +0
1
6, 8, 15, 21, 33, 39, 51, 57, 69, 87, 93, 111, 123, 129, 141, 159, 177, 183, 201, 213, 219, 237, 249, 267, 291, 303, 309, 321, 327, 339, 381, 393, 411, 417, 447, 453, 471, 489, 501, 519, 537, 543, 573, 579, 591, 597, 633, 669, 681, 687, 699, 717, 723, 753 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) C(n)=sigma(n)-n-1; H(n)=eulerphi(n)/2; j=[]; for(n=1, 1200, if(C(n)==H(n)+numdiv(n), j=concat(j, n))); j

CROSSREFS

Cf. A048050, A023022, A000005.

Sequence in context: A066160 A100914 A076672 this_sequence A022320 A100646 A074838

Adjacent sequences: A063531 A063532 A063533 this_sequence A063535 A063536 A063537

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 02 2001

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 August 28 19:25 EDT 2008. Contains 143183 sequences.


AT&T Labs Research