cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A259603 a(n) = (A259429(n) + A259429(n+1)) / 2.

Original entry on oeis.org

8, 27, 64, 125, 216, 343, 216, 27, 64, 125, 216, 343, 216, 27, 64, 125, 216, 343, 216, 27, 64, 125, 216, 343, 216, 27, 64, 125, 216, 343, 216, 27, 64, 125, 216, 343, 216, 64, 125, 216, 343, 512, 343, 64, 125, 216, 125, 8, 27, 64, 125, 216, 343, 216, 8, 27
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2015

Keywords

Comments

All terms are cubes by definition of A259260.

Links

Crossrefs

Cf. A259429, A000578, A086517, A259260, A259602, A259604, A259605.

Programs

  • Haskell
    a259603 n = a259603_list !! (n-1)
a259603_list = zipWith ((flip div 2 .) . (+))
                       a259429_list $ tail a259429_list

A259537 Smallest m such that A259429(m) = 2*n-1.

Original entry on oeis.org

1, 56, 48, 147, 148, 49, 55, 2, 8, 14, 20, 26, 32, 38, 33, 27, 21, 15, 9, 3, 66, 50, 149, 158, 177, 57, 74, 88, 102, 116, 130, 45, 44, 131, 117, 103, 89, 75, 58, 178, 157, 150, 51, 65, 4, 10, 16, 22, 28, 34, 39, 139, 125, 111, 97, 83, 496, 186, 196, 163, 173
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2015

Keywords

Comments

Sequence is defined for all numbers iff A259429 is a permutation of the odd numbers;
A259429(a(n)) = 2*n-1.

Links

Crossrefs

Cf. A259429.

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
a259537 = (+ 1) . fromJust . (`elemIndex` a259429_list) . subtract 1 . (* 2)

A086517 a(1) = 1 and then the smallest odd number not included earlier such that the arithmetic mean of a pair of successive terms is prime.

Original entry on oeis.org

1, 3, 7, 15, 11, 23, 35, 27, 19, 39, 43, 31, 51, 55, 63, 59, 47, 71, 75, 67, 79, 87, 91, 103, 99, 95, 83, 111, 107, 119, 135, 127, 147, 115, 139, 123, 131, 143, 155, 159, 167, 179, 183, 151, 163, 171, 175, 187, 195, 191, 203, 219, 227, 231, 215, 207, 239, 243, 211
Offset: 1

Views

Author

Amarnath Murthy, Jul 30 2003

Keywords

Comments

Second term onwards rearrangement of odd numbers of the type 4n+3.

Links

Crossrefs

Cf. A086518.
Cf. A259565, A259260, A259429, A259542, A010051, A005408.

Programs

  • Haskell
    import Data.List (delete)
a086517 n = a086517_list !! (n-1)
a086517_list = 1 : f 1 [3, 5 ..] where
   f x zs = g zs where
     g (y:ys) = if a010051' ((x + y) `div` 2) == 1
                   then y : f y (delete y zs) else g ys
-- Reinhard Zumkeller, Jun 30 2015
  • PARI
    v=[1];n=1;while(n<100,s=(n+v[#v])/2;if(type(s)=="t_INT",if(isprime(s)&&!vecsearch(vecsort(v),n),v=concat(v,n);n=0));n++);v \\ Derek Orr, Jun 16 2015

Extensions

More terms from David Wasserman, Mar 10 2005

A259260 With a(1) = 1, a(n) is the smallest number not already in the sequence such that the arithmetic mean of two neighboring terms is a square.

Original entry on oeis.org

1, 7, 11, 21, 29, 3, 5, 13, 19, 31, 41, 9, 23, 27, 45, 53, 75, 87, 113, 15, 17, 33, 39, 59, 69, 93, 35, 37, 61, 67, 95, 105, 57, 71, 91, 109, 133, 155, 183, 209, 79, 49, 151, 137, 25, 47, 51, 77, 85, 43, 55, 73, 89, 111, 131, 157, 181, 107, 135, 65, 63, 99, 101, 141, 147, 191, 97, 103, 139, 149, 189, 203, 247, 145
Offset: 1

Views

Author

Derek Orr, Jun 22 2015

Keywords

Comments

Conjectured to be a permutation of the odd numbers.
A259602(n) = (a(n) + a(n+1)) / 2; a(A259526(n)) = 2*n-1. - Reinhard Zumkeller, Jun 29 2015

Links

Crossrefs

Cf. A034175, A086517.
Cf. A010052, A005408.
Cf. A259602, A259565, A259429, A259542.

Programs

  • Haskell
    import Data.List (delete)
a259260 n = a259260_list !! (n-1)
a259260_list = 1 : f 1 [3, 5 ..] where
   f x zs = g zs where
     g (y:ys) = if a010052 ((x + y) `div` 2) == 1
                   then y : f y (delete y zs) else g ys
-- Reinhard Zumkeller, Jun 29 2015
  • Mathematica
    s={1}; Do[n = Last@ s; a=2; While[(b = 2*a^2 - n) <= 0 || MemberQ[s, b], a++]; AppendTo[s, b], {100}]; s (* Giovanni Resta, Jun 23 2015 *)
  • PARI
    v=[1];n=1;while(#v<100,s=(n+v[#v])/2;if(type(s)=="t_INT",if(issquare(s)&&!vecsearch(vecsort(v),n),v=concat(v,n);n=0));n++);v

A259542 a(1) = 1, for n > 1 a(n) = smallest number not already in the sequence such that the arithmetic mean of two neighboring terms is a triangular number.

Original entry on oeis.org

1, 5, 7, 13, 17, 3, 9, 11, 19, 23, 33, 39, 51, 21, 35, 37, 53, 57, 15, 27, 29, 43, 47, 25, 31, 41, 49, 61, 71, 85, 97, 59, 73, 83, 99, 111, 45, 65, 67, 89, 93, 63, 69, 87, 95, 115, 125, 147, 159, 81, 75, 107, 103, 79, 77, 55, 101, 109, 131, 141, 165, 177
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2015

Keywords

Comments

A259604(n) = (a(n) + a(n+1)) / 2;
conjecture: sequence is a permutation of the odd numbers, see also A259260, A259429;
a(A259543(n)) = 2*n-1.

Links

Crossrefs

Cf. A259260, A259429, A010054, A005408, A259604.

Programs

  • Haskell
    import Data.List (delete)
a259542 n = a259542_list !! (n-1)
a259542_list = 1 : f 1 [3, 5 ..] where
   f x zs = g zs where
     g (y:ys) = if a010054 ((x + y) `div` 2) == 1
                   then y : f y (delete y zs) else g ys

A259565 a(1) = 1, for n > 1 a(n) = smallest number not already in the sequence such that the arithmetic mean of two neighboring terms is a squarefree number.

Original entry on oeis.org

1, 3, 7, 5, 9, 11, 15, 13, 17, 21, 23, 19, 25, 27, 31, 29, 33, 35, 39, 37, 41, 43, 49, 45, 47, 55, 51, 59, 57, 53, 61, 63, 67, 65, 69, 71, 75, 73, 81, 77, 79, 85, 87, 83, 89, 93, 95, 91, 97, 105, 99, 103, 101, 109, 111, 107, 113, 115, 121, 117, 119, 125, 129
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2015

Keywords

Comments

A259605(n) = (a(n) + a(n+1)) / 2;
conjecture: sequence is a permutation of the odd numbers;
a(A259570(n)) = 2*n-1.

Links

Crossrefs

Cf. A086517, A259260, A259429, A259542, A008966, A005117, A005408, A259570.
Cf. A259605.

Programs

  • Haskell
    import Data.List (delete)
a259565 n = a259565_list !! (n-1)
a259565_list = 1 : f 1 [3, 5 ..] where
   f x zs = g zs where
     g (y:ys) = if a008966 ((x + y) `div` 2) == 1
                   then y : f y (delete y zs) else g ys
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.