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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065160 Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n. 3
1, 2, 5, 4, 17, 18, 73, 8, 65, 66, 529, 68, 545, 546, 4369, 16, 257, 258, 4129, 260, 4161, 4162, 66593, 264, 4225, 4226, 67617, 4228, 67649, 67650, 1082401, 32, 1025, 1026, 32833, 1028, 32897, 32898, 1052737, 1032, 33025, 33026, 1056833, 33028, 1056897 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

By convention a(0)=0. a(2^n)=2^n. a(4n+2)=1+a(4n+1). a(n)=A065158(n,n)=A065157(n,n)/n=A065159(n)/n.

LINKS

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

FORMULA

a(2^n)=2^n. a(4n+2)=1+a(4n+1). a(n)=A065158(n, n)=A065157(n, n)/n=A065159(n)/n.

a(n)=z(n, A062383(n)) with z(u, v) = if u=0 then 0 else if u mod 2 = 0 then z(u/2, v)*2 else z([u/2], v)*v+1. - Reinhard Zumkeller, Feb 15 2004

EXAMPLE

a(5): 5=101->(101)0(101)=1010101=85; 85/5=17.

CROSSREFS

Cf. A065157, A065158. Equals A065159(n)/n.

Sequence in context: A251554 A002518 A093727 * A255544 A019152 A013621

Adjacent sequences:  A065157 A065158 A065159 * A065161 A065162 A065163

KEYWORD

base,easy,nonn

AUTHOR

Marc LeBrun, Oct 18 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 2 19:13 EST 2016. Contains 278683 sequences.