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!)
A147795 If n=A000695(k_n)+2*A000695(l_n), then a(n) is the number of nonnegative integers m<n such that k_m differs from k_n and l_m differs from l_n. 0
0, 0, 1, 1, 2, 2, 3, 3, 6, 6, 7, 7, 8, 8, 9, 9, 12, 12, 13, 13, 14, 14, 15, 15, 18, 18, 19, 19, 20, 20, 21, 21, 28, 28, 29, 29, 30, 30, 31, 31, 34, 34, 35, 35, 36, 36, 37, 37, 40, 40, 41, 41, 42, 42, 43, 43, 46, 46, 47, 47, 48, 48, 49, 49 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Let us call integers m and n collinear one to another if either A059905(m)=A059905(n) or A059906(m)=A059906(n). Then a(n) is the number of noncollinear to n nonnegative integers not exceeding n.

LINKS

Table of n, a(n) for n=0..63.

FORMULA

Theorem: a(2n)=a(2n+1).

CROSSREFS

Cf. A000695, A054238, A059905, A059906.

Sequence in context: A145787 A096111 A101081 * A038716 A168659 A035642

Adjacent sequences:  A147792 A147793 A147794 * A147796 A147797 A147798

KEYWORD

nonn

AUTHOR

Vladimir Shevelev, Nov 13 2008

EXTENSIONS

More terms from Philippe Deléham, Oct 18 2011

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 02:09 EST 2014. Contains 249867 sequences.