Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143275 A054525 * A029935. +0
1
1, 1, 3, 3, 7, 3, 11, 7, 12, 7, 19, 9, 23, 11, 21, 16, 31, 12, 35, 21, 33, 19, 43, 21, 48, 23, 44, 33, 55, 21, 59, 36, 57, 31, 77, 36, 71, 35, 69, 49, 79, 33, 83, 57, 84, 43, 91, 48, 108, 48, 93, 69, 103, 44, 133, 77, 105, 55, 115, 63, 119, 59, 132, 80, 161, 57, 131, 93, 129 (list; graph; listen)
OFFSET

1,3

FORMULA

Mobius transform (A054525) of A029935: (1, 2, 4, 5, 8, 8, 12, 12, 16,...).

EXAMPLE

a(4) = 3 = (0, -1, 0, 1) dot (1, 2, 4, 5) = (0 - 2 + 0 + 5), where K(0, -1, 0, 1) = row 4 of A054525 and A143275 = (1, 2, 4, 5, 8, 8, 12,...).

MAPLE

read("transforms") : A029935 := proc(n) local a, d ; a := 0 ; for d in numtheory[divisors](n) do a := a+ numtheory[phi](d)*numtheory[phi](n/d); od; RETURN(a) ; end: a029935 := [seq(A029935(n), n=1..300)] ; a143275 := MOBIUS(a029935) ; for i from 1 to nops(a143275) do printf("%d, ", op(i, a143275)) ; od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 19 2009]

CROSSREFS

Cf. A029935, A054525.

Sequence in context: A135434 A164928 A069949 this_sequence A083262 A122978 A119347

Adjacent sequences: A143272 A143273 A143274 this_sequence A143276 A143277 A143278

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 03 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 19 2009

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research