|
| |
|
|
A091067
|
|
Numbers a(n) such that odd part of a(n) is of form 4k+3.
|
|
9
| |
|
|
3, 6, 7, 11, 12, 14, 15, 19, 22, 23, 24, 27, 28, 30, 31, 35, 38, 39, 43, 44, 46, 47, 48, 51, 54, 55, 56, 59, 60, 62, 63, 67, 70, 71, 75, 76, 78, 79, 83, 86, 87, 88, 91, 92, 94, 95, 96, 99, 102, 103, 107, 108, 110, 111, 112, 115, 118, 119, 120, 123, 124, 126, 127, 131
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Either of form 2a(m) or 4k+3, k>=0, 0<m<n.
A000265(a(n)) is an element of A004767.
a(n) such that A038189(a(n)) = 1.
Conjecture: a(n) = A060833(n+1) - 1.
Numbers n such that kronecker(-n,m)=kronecker(m,n) for all m. - Michael Somos Sep 22 2005
A014707(a(n) + 1) = 1. [Reinhard Zumkeller, Sep 28 2011]
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
PROG
| (PARI) for(n=1, 200, if(((n/2^valuation(n, 2)-1)/2)%2, print1(n", ")))
(PARI) {a(n)= local(m, c); if(n<1, 0, c=0; m=1; while( c<n, m++; if( ((m/2^valuation(m, 2)-1)/2)%2, c++)); m)} /* Michael Somos Sep 22 2005 */
(Haskell)
import Data.List (elemIndices)
a091067 n = a091067_list !! (n-1)
a091067_list = map (+ 1) $ elemIndices 1 a014707_list
-- Reinhard Zumkeller, Sep 28 2011
|
|
|
CROSSREFS
| Complement of A091072.
Sequence in context: A087643 A022544 A194366 * A120511 A176864 A022550
Adjacent sequences: A091064 A091065 A091066 * A091068 A091069 A091070
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Ralf Stephan (ralf(AT)ark.in-berlin.de), Feb 22 2004
|
| |
|
|
