The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A191122

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A191122

Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and 4x are in a.
(history; published version)

#10 by Charles R Greathouse IV at Sat Jul 13 12:04:10 EDT 2013

LINKS

_Reinhard Zumkeller_, , <a href="/A191122/b191122.txt">Table of n, a(n) for n = 1..10000</a>

Discussion

Sat Jul 13

12:04

OEIS Server: https://oeis.org/edit/global/1934

#9 by N. J. A. Sloane at Fri Feb 22 21:38:58 EST 2013

LINKS

_Reinhard Zumkeller, _, <a href="/A191122/b191122.txt">Table of n, a(n) for n = 1..10000</a>

PROG

-- _Reinhard Zumkeller, _, Jun 01 2011

Discussion

Fri Feb 22

21:38

OEIS Server: https://oeis.org/edit/global/1866

#8 by Russ Cox at Fri Mar 30 18:57:29 EDT 2012

AUTHOR

_Clark Kimberling (ck6(AT)evansville.edu), _, May 27 2011

Discussion

Fri Mar 30

18:57

OEIS Server: https://oeis.org/edit/global/285

#7 by Joerg Arndt at Mon Jun 13 09:17:27 EDT 2011

STATUS

proposed

approved

#6 by Reinhard Zumkeller at Sat Jun 11 07:33:03 EDT 2011

LINKS

Reinhard Zumkeller, <a href="/A191122/a191122b191122.txt">TITLE FOR LINKTable of n, a(n) for n = 1..10000</a>

#5 by Reinhard Zumkeller at Wed Jun 01 17:35:16 EDT 2011

PROG

-- Reinhard Zumkeller, Jun 01 20102011

Discussion

Thu Jun 02

03:55

Joerg Arndt: Please edit link title.

Sat Jun 11

06:44

Joerg Arndt: Ping!

#4 by Reinhard Zumkeller at Wed Jun 01 17:12:18 EDT 2011

LINKS

Reinhard Zumkeller, <a href="/A191122/a191122.txt">TITLE FOR LINK</a>

PROG

(Haskell)

import Data.Set (singleton, deleteFindMin, insert)

a191122 n = a191122_list !! (n-1)

a191122_list = f $ singleton 1

where f s = m : (f $ insert (3*m-1) $ insert (4*m) s')

where (m, s') = deleteFindMin s

-- Reinhard Zumkeller, Jun 01 2010

STATUS

approved

proposed

#3 by T. D. Noe at Fri May 27 16:47:39 EDT 2011

STATUS

proposed

approved

#2 by Clark Kimberling at Fri May 27 15:47:56 EDT 2011

NAME

allocated for Clark KimberlingIncreasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and 4x are in a.

DATA

1, 2, 4, 5, 8, 11, 14, 16, 20, 23, 32, 41, 44, 47, 56, 59, 64, 68, 80, 92, 95, 122, 128, 131, 140, 164, 167, 176, 188, 191, 203, 224, 236, 239, 256, 272, 275, 284, 320, 365, 368, 380, 383, 392, 419, 488, 491, 500, 512, 524, 527, 560, 563, 572, 608, 656, 668, 671, 704, 707, 716, 752, 764, 767, 812, 815, 824, 851, 896, 944, 956, 959

OFFSET

1,2

COMMENTS

See A191113.

MATHEMATICA

h = 3; i = -1; j = 4; k = 0; f = 1; g = 9;

a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191122 *)

b = (a + 1)/3; c = a/4; r = Range[1, 1500];

d = Intersection[b, r] (* A191168 *)

e = Intersection[c, r] (* A191169 *)

CROSSREFS

Cf. A191113.

KEYWORD

allocated

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), May 27 2011

STATUS

approved

proposed

#1 by Clark Kimberling at Thu May 26 15:16:11 EDT 2011

NAME

allocated for Clark Kimberling

KEYWORD

allocated

STATUS

approved