login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074988 Numbers n such that the k-th binary digit of n equals mu(k)^2 for k=1 up to A029837(n+1). 1
1, 3, 7, 14, 29, 59, 119, 238, 476, 953, 1907, 3814, 7629, 15259, 30519, 61038, 122077, 244154, 488309, 976618, 1953237, 3906475, 7812951, 15625902, 31251804, 62503609, 125007218, 250014436, 500028873, 1000057747, 2000115495 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..31.

FORMULA

a(n+1)=2*a(n)+mu(n+1)^2 a(n)=sum(i=1, n, mu(i)^2*2^(n-i))

a(n)=sum{k=0..n, abs(mu(n-k+1))*2^k}; - Paul Barry, Jul 20 2005

EXAMPLE

59 = 111011 and mu(1)^2,mu(2)^2,mu(3)^2,mu(4)^2,mu(5)^2,mu(6)^2 = 1,1,1,0,1,1 hence 59 is in the sequence

PROG

(PARI) a(n)=sum(i=1, n, moebius(i)^2*2^(n-i))

CROSSREFS

Cf. A008683

Sequence in context: A157672 A125899 A052997 * A066225 A139817 A173010

Adjacent sequences:  A074985 A074986 A074987 * A074989 A074990 A074991

KEYWORD

base,easy,nonn

AUTHOR

Benoit Cloitre, Oct 02 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 24 12:07 EST 2014. Contains 249898 sequences.