id:A096068 - OEIS Search Results

Search: id:A096068

Displaying 1-1 of 1 results found.

page 1

Concatenated in binary representation: largest proper divisor of n and smallest prime factor of n.

+0
1

3, 6, 7, 10, 13, 14, 15, 18, 15, 22, 27, 26, 29, 30, 23, 34, 49, 38, 51, 42, 31, 46, 55, 50, 45, 54, 39, 58, 61, 62, 63, 66, 47, 70, 61, 74, 101, 78, 55, 82, 105, 86, 107, 90, 63, 94, 111, 98, 63, 102, 71, 106, 117, 110, 93, 114, 79, 118, 123, 122, 125, 126, 87, 130, 109 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n)=A020639(n)*A000079((A000523(A020639(n))+1))+A020639(n);` `a(A000040(n))=A000079((A000523(A000040(n))+1))+A000040(n);` `a(A005843(n))=A005843(A005408(n)); a(A000225(n))=A000225(n+1); a(A000079(n))=A052548(n+1).`
	EXAMPLE	`n=99: smallest factor = 3->'11' and greatest proper divisor =` `99/3 = 33->'100001': '10001'&'11'='10000111'->a(99)=135.`
	CROSSREFS	`Sequence in context: A096604 A008912 A101885 this_sequence A045412 A047281 A100468` `Adjacent sequences: A096065 A096066 A096067 this_sequence A096069 A096070 A096071`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jul 21 2004`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research