Non-palindromic numbers A strictly non-palindromic number N is a number that isn't a palindrome in any base (in bases 2 to N-2).  These numbers are listed on OEIS
For example, the number 19 in base 2,3,4,5,6,...17 is: 10011,201,103,34,31,...12.  None of these representations is palindromic, so the number is strictly non-palindromic.
For this challenge, you need to return a truthy value if the number is non-palindromic, otherwise a falsy value.

You may assume the number passed to you is greater than or equal to 0.
Your program should work for values up to your languages' integer size.

Test cases:
Truthy:
0
1
2
3
4
6
11
19
47
53
79
103
389
997
1459

Falsy:
5
7
8
9
10
13
16
43
48
61
62
101
113
211
1361

This is a code-golf, so make your answers as short as possible!
C, 82 bytes



p(n,a,b,c,r){c=0;for(b=1;++b&lt;n-2;c+=r==n)for(a=n,r=0;a&gt;0;a/=b)r=r*b+a%b;return!c;}


Ideone it!

Explanation

This code reverses n in base b and stores in r:

for(a=n,r=0;a&gt;0;a/=b)r=r*b+a%b;


The outer loop counts the number of bases from 2 to n-1 in which n is a palindrome.

If n is non-palindromic, the count would be 1 (n must be a palindrome in base n-1).