id:A063529 - OEIS Search Results

Search: id:A063529

Displaying 1-1 of 1 results found.

page 1

M[2^n-1], where M[] is A029834, a discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0, and 2^n-1 is A000225.

+0
1

0, 1, 1, 0, 3, 0, 4, 0, 0, 0, 0, 0, 9, 0, 0, 0, 11, 0, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 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, 42, 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, 61, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,5`
	PROGRAM	`(PARI) j=[]; for(n=1, 150, j=concat(j, if(isprime(2^n-1), floor(log(2^n-1)), ))); j`
	CROSSREFS	`Cf. A029832, A029833, A053821, A062590, A029834, A000225.` `Sequence in context: A060533 A128252 A033596 this_sequence A136667 A004588 A066705` `Adjacent sequences: A063526 A063527 A063528 this_sequence A063530 A063531 A063532`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jason Earls (jcearls(AT)cableone.net), Aug 01 2001`

page 1

Search completed in 0.002 seconds

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.

AT&T Labs Research