Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147795
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147795 If n=A000695(k_n)+2A000695(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
1
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 (list; graph; listen)
OFFSET

0,5

COMMENT

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.

FORMULA

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

CROSSREFS

A000695 A059905 A059906

Sequence in context: A145787 A096111 A101081 this_sequence A038716 A035642 A133392

Adjacent sequences: A147792 A147793 A147794 this_sequence A147796 A147797 A147798

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Nov 13 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research