id:A000038 - OEIS Search Results

Search: id:A000038

Displaying 1-1 of 1 results found.

page 1

Twice A000007.
(Formerly M0004)

+0
2

2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Multiplicative with a(p^e) = 0. Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu) Jun 09, 2005.` `1+(-1)^nth prime. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 29 2009]`
	REFERENCES	`N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	LINKS	`Daniele A. Gewurz and Francesca Merola, Sequences realized as Parker vectors ..., J. Integer Seqs., Vol. 6, 2003.`
	FORMULA	`a(n)=2*A000007(n)=(-1)^A000040(n)+1. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 29 2009]`
	CROSSREFS	`Cf. A007395.` `Cf. A000007, A000040. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 29 2009]` `Sequence in context: A072507 A130779 A130706 this_sequence A063667 A014083 A112315` `Adjacent sequences: A000035 A000036 A000037 this_sequence A000039 A000040 A000041`
	KEYWORD	`easy,nonn,mult`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified March 20 07:51 EDT 2010. Contains 173643 sequences.

AT&T Labs Research