Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027414
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027414 G.f. for Moebius transform is (1 + x) / (1 + x^4). +0
1
1, 2, 1, 2, 0, 1, 1, 2, 2, 2, 1, 1, 0, 1, 0, 2, 2, 3, 1, 2, 0, 1, 1, 1, 1, 2, 2, 1, 0, 0, 1, 2, 2, 4, 0, 3, 0, 1, 0, 2, 2, 0, 1, 1, 0, 1, 1, 1, 2, 4, 2, 2, 0, 2, 0, 1, 2, 2, 1, 0, 0, 1, 1, 2, 0, 2, 1, 4, 0, 0, 1, 3, 2, 2, 1, 1, 0, 0, 1, 2, 3, 4, 1, 0, 0, 1, 0, 1, 2, 2, 0, 1, 0, 1, 0, 1, 2, 3, 3, 4, 0, 2, 1, 2, 0 (list; graph; listen)
OFFSET

0,2

LINKS

N. J. A. Sloane, Transforms

FORMULA

Moebius transform is period 8 sequence [1, 1, 0, 0, -1, -1, 0, 0, ...]. - Michael Somos Sep 20 2005

G.f.: Sum_{k>0} x^k*(1+x^k)/(1+x^(4k)). - Michael Somos Sep 20 2005

PROGRAM

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, kronecker(-4, (d-1)%8\2+1))) /* Michael Somos Sep 20 2005 */

CROSSREFS

Sequence in context: A092149 A127173 A035160 this_sequence A140083 A057985 A135387

Adjacent sequences: A027411 A027412 A027413 this_sequence A027415 A027416 A027417

KEYWORD

nonn

AUTHOR

njas

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research