The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055045 Numbers of the form 4^i*(8*j+5). 4
 5, 13, 20, 21, 29, 37, 45, 52, 53, 61, 69, 77, 80, 84, 85, 93, 101, 109, 116, 117, 125, 133, 141, 148, 149, 157, 165, 173, 180, 181, 189, 197, 205, 208, 212, 213, 221, 229, 237, 244, 245, 253, 261, 269, 276, 277, 285, 293, 301, 308, 309, 317 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Numbers not of the form x^2+2y^2+6z^2. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 L. E. Dickson, Integers represented by positive ternary quadratic forms, Bull. Amer. Math. Soc. 33 (1927), 63-70. See Theorem XI. L. J. Mordell, A new Waring's problem with squares of linear forms, Quart. J. Math., 1 (1930), 276-288 (see p. 283). FORMULA a(n) = 6n + O(log n). - Charles R Greathouse IV, Dec 19 2013 PROG (PARI) is(n)=n/=4^valuation(n, 4); n%8==5 \\ Charles R Greathouse IV and V. Raman, Dec 19 2013 (Haskell) a055045 n = a055045_list !! (n-1) a055045_list = filter ((== 5) . (flip mod 8) . f) [1..] where f x = if r == 0 then f x' else x where (x', r) = divMod x 4 -- Reinhard Zumkeller, Jan 02 2014 (Python) from itertools import count, islice def A055045_gen(startvalue=1): # generator of terms >= startvalue return filter(lambda n:not (m:=(~n&n-1).bit_length())&1 and (n>>m)&7==5, count(max(startvalue, 1))) A055045_list = list(islice(A055045_gen(), 30)) # Chai Wah Wu, Jul 09 2022 CROSSREFS Cf. A004215, A055046, A234000. Sequence in context: A227500 A265814 A087714 * A213741 A184825 A190372 Adjacent sequences: A055042 A055043 A055044 * A055046 A055047 A055048 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Jun 01 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 10 19:34 EDT 2023. Contains 363207 sequences. (Running on oeis4.)