A022941 -id:A022941 - cp's OEIS frontend

A143344 First differences of A022941.

1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 77

Offset: 1

N. J. A. Sloane, Nov 01 2009

This is (essentially) the sequence c() mentioned in the definition of A022941.

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Cf. A022941, A156031.

import Data.List (delete)
a143344 n = a143344_list !! (n-1)
a143344_list = zipWith (-) (tail a022941_list) a022941_list
-- Reinhard Zumkeller, May 17 2013

a[1]:=1: a[2]:=2: c[1]:=3: for n from 2 to 70 do c[n]:=c[n-1]+1: for k from 1 to n do if(c[n]<=a[k])then if(c[n]=a[k])then c[n]:=c[n]+1: fi: break: fi: od: a[n+1]:=a[n]+c[n-1]: od: seq(c[n],n=1..70); # Nathaniel Johnston, May 01 2011

a(26), a(27) corrected by Nathaniel Johnston, May 01 2011

A156031 Alternate A022941 and A143344.

Original entry on oeis.org

1, 2, 3, 5, 4, 9, 6, 15, 7, 22, 8, 30, 10, 40, 11, 51, 12, 63, 13, 76, 14, 90, 16, 106, 17, 123, 18, 141, 19, 160, 20, 180, 21, 201, 23, 224, 24, 248, 25, 273, 26, 299, 27, 326, 28, 354, 29, 383, 31, 414, 32, 446, 33, 479, 34, 513, 35, 548, 36, 584, 37, 621, 38, 659, 39, 698

Offset: 1

N. J. A. Sloane, Nov 01 2009, based on a posting by Eric Angelini to the Sequence Fans Mailing List

nonn

Eric Angelini's definition was: start with 1,2,3; then alternately adjoin either the sum of the last two terms or the smallest number not yet in the sequence.

M. F. Hasler, Table of n, a(n) for n = 1..2001

Cf. A022941, A143344, A167151, A005228, A030124.

import Data.List (transpose)
a156031 n = a156031_list !! n
a156031_list = tail $ concat (transpose [a022941_list, a143344_list])
-- Reinhard Zumkeller, May 17 2013

f="b156031.txt"; used=[]; write(f,c=1," ",b=1);a=1; for(i=1,1e3, used=setunion(used,Set(a+=b)); while(setsearch(used,b++), used=setminus(used,Set(b))); write(f,c++," "a"\n",c++," "b)) \\ M. F. Hasler, Nov 01 2009

A005228 Sequence and first differences (A030124) together list all positive numbers exactly once.

Original entry on oeis.org

1, 3, 7, 12, 18, 26, 35, 45, 56, 69, 83, 98, 114, 131, 150, 170, 191, 213, 236, 260, 285, 312, 340, 369, 399, 430, 462, 495, 529, 565, 602, 640, 679, 719, 760, 802, 845, 889, 935, 982, 1030, 1079, 1129, 1180, 1232, 1285, 1339, 1394, 1451, 1509, 1568, 1628, 1689

Offset: 1

N. J. A. Sloane

This is the lexicographically earliest sequence that together with its first differences (A030124) contains every positive integer exactly once.
Hofstadter introduces this sequence in his discussion of Scott Kim's "FIGURE-FIGURE" drawing. - N. J. A. Sloane, May 25 2013
A225850(a(n)) = 2*n-1, cf. A167151. - Reinhard Zumkeller, May 17 2013
In view of the definition of A075326: start with a(0) = 0, and extend by rule that the next term is the sum of the predecessor and the most recent non-member of the sequence. - Reinhard Zumkeller, Oct 26 2014

			Sequence reads 1 3 7 12 18 26 35 45..., differences are 2 4 5, 6, 8, 9, 10 ... and the point is that every number not in the sequence itself appears among the differences. This property (together with the fact that both the sequence and the sequence of first differences are increasing) defines the sequence!

E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.
D. R. Hofstadter, Goedel, Escher, Bach: an Eternal Golden Braid, Random House, 1980, p. 73.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, Table of n, a(n) for n = 1..10001 [The first 1000 terms were computed by T. D. Noe]
A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004.
Catalin Francu, C++ program
Cristian Francu, C program to generate the N-th element in O(sqrt(N))
D. R. Hofstadter, Eta-Lore [Cached copy, with permission]
D. R. Hofstadter, Pi-Mu Sequences [Cached copy, with permission]
D. R. Hofstadter and N. J. A. Sloane, Correspondence, 1977 and 1991
Benoit Jubin, Asymptotic series for Hofstadter's figure-figure sequences, arXiv:1404.1791; J. Integer Sequences, 17 (2014), #14.7.2.
Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
David Singmaster, Letter to N. J. A. Sloane, Oct 3 1982.
Eric Weisstein's World of Mathematics, Hofstadter Figure-Figure Sequence.
Index entries for sequences from "Goedel, Escher, Bach"
Index entries for Hofstadter-type sequences

Cf. A030124 (complement), A037257, A056731, A056738, A140778, A225687.
The following are a group of related sequences: A005132, A006509, A037257, A037258, A037259, A081145, A093903, A099004, A100707, A129198, A129199, A140778, A225376, A225377, A225378, A225385, A225386, A225387.
Cf. A075326, A095115.
Cf. A225850, A232746, A232747 (inverse), A232739, A232740, A232750 and also permutation pair A232751/A232752 constructed from this sequence and its complement.
Cf. A001651 (analog with sums instead of differences), A121229 (analog with products).
The same recurrence a(n) = a(n-1) + c(n-1) with different starting conditions: A061577 (starting with 2), A022935 (3), A022936 (4), A022937 (5), A022938 (6).
Related recurrences:
a(n-1) + c(n+1) - A022953, A022954.
a(n-1) + c(n) - A022946 to A022952.
a(n-1) + c(n-2) - A022940, A022941.
a(n-2) + c(n-1) - A022942 to A022944.
a(n-2) + c(n-2) - A022939.
a(n-3) + c(n-3) - A022955.
a(n-4) + c(n-4) - A022956.
a(n-5) + c(n-5) - A022957.

a005228 = scanl (+) 1 a030124
a030124 = go 1 a005228 where go x ys | x < head ys = x     : go (x + 1) ys
                                     | otherwise   = x + 1 : go (x + 2) (tail ys)
-- Maks Verver, Jun 30 2025

maxn := 5000; h := array(1..5000); h[1] := 1; a := [1]; i := 1; b := []; for n from 2 to 1000 do if h[n] <> 1 then b := [op(b), n]; j := a[i]+n; if j < maxn then a := [op(a),j]; h[j] := 1; i := i+1; fi; fi; od: a; b; # a is A005228, b is A030124.
A030124 := proc(n)
    option remember;
    local a,fnd,t ;
    if n <= 1 then
        op(n+1,[2,4]) ;
    else
        for a from procname(n-1)+1 do
            fnd := false;
            for t from 1 to n+1 do
                if A005228(t)  = a then
                    fnd := true;
                    break;
                end if;
            end do:
            if not fnd then
                return a;
            end if;
        end do:
    end if;
end proc:
A005228 := proc(n)
    option remember;
    if n <= 2 then
        op(n,[1,3]) ;
    else
        procname(n-1)+A030124(n-2) ;
    end if;
end proc: # R. J. Mathar, May 19 2013

a = {1}; d = 2; k = 1; Do[ While[ Position[a, d] != {}, d++ ]; k = k + d; d++; a = Append[a, k], {n, 1, 55} ]; a
(* Second program: *)
(* Program from Larry Morris, Jan 19 2017: *)
d = 3; a = {1, 3, 7, 12, 18}; While[ Length[a = Join[a, a[[-1]] + Accumulate[Range[a[[d]] + 1, a[[++d]] - 1]]]] < 50]; a
(* Comment: This adds as many terms to the sequence as there are numbers in each set of sequential differences. Consequently, the list of numbers it produces may be longer than the limit provided. With the limit of 50 shown, the sequence produced has length 60. *)

A005228(n,print_all=0,s=1,used=0)={while(n--,used += 1<M. F. Hasler, Feb 05 2013

a(n) = a(n-1) + c(n-1) for n >= 2, where a(1)=1, a( ) increasing, c( ) = complement of a( ) (c is the sequence A030124).
Let a(n) = this sequence, b(n) = A030124 prefixed by 0. Then b(n) = mex{ a(i), b(i) : 0 <= i < n}, a(n) = a(n-1) + b(n) + 1. (Fraenkel)
a(1) = 1, a(2) = 3; a( ) increasing; for n >= 3, if a(q) = a(n-1)-a(n-2)+1 for some q < n then a(n) = a(n-1) + (a(n-1)-a(n-2)+2), otherwise a(n) = a(n-1) + (a(n-1)-a(n-2)+1). - Albert Neumueller (albert.neu(AT)gmail.com), Jul 29 2006
a(n) = n^2/2 + n^(3/2)/(3*sqrt(2)) + O(n^(5/4)) [proved in Jubin link]. - Benoit Jubin, May 13 2015
For all n >= 1, A232746(a(n)) = n and A232747(a(n)) = n. [Both sequences work as left inverses of this sequence.] - Antti Karttunen, May 14 2015

Additional comments from Robert G. Wilson v, Oct 24 2001

Incorrect formula removed by Benoit Jubin, May 13 2015

A167151 a(2n+1) = a(2n) + a(2n-1), a(2n)=least number not yet in the sequence, a(1)=1.

Original entry on oeis.org

0, 1, 2, 3, 4, 7, 5, 12, 6, 18, 8, 26, 9, 35, 10, 45, 11, 56, 13, 69, 14, 83, 15, 98, 16, 114, 17, 131, 19, 150, 20, 170, 21, 191, 22, 213, 23, 236, 24, 260, 25, 285, 27, 312, 28, 340, 29, 369, 30, 399, 31, 430, 32, 462, 33, 495, 34, 529, 36, 565, 37, 602, 38, 640, 39, 679

Offset: 0

M. F. Hasler, Nov 01 2009

Lexicographically earliest reordering of the nonnegative integers (can be extended by symmetry to a permutation of all integers) such that a(2n+1) = a(2n) + a(2n-1).

Cf. A022941, A143344, A156031.

Cf. A225850 (inverse).

import Data.List (transpose)
a167151 n = a167151_list !! n
a167151_list = 0 : concat (transpose [a005228_list, a030124_list])
-- Reinhard Zumkeller, May 17 2013

a[0] = 0; a[1] = 1;
a[n_?OddQ] := a[n] = a[n - 1] + a[n - 2];
a[n_?EvenQ] := a[n] = For[k = 2, True, k++,
     If[FreeQ[Array[a, n - 1], k], Return[k]]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Dec 02 2021 *)

{used=[]; print1(b=0); a=1; for(i=1,99, used=setunion(used,Set(a+=b)); while(setsearch(used,b++), used=setminus(used,Set(b))); print1(", "a", "b))}

a(2n-1) = A005228(n); a(2n) = A030124(n).

cp's OEIS Frontend

A143344 First differences of A022941.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Extensions

A156031 Alternate A022941 and A143344.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

PARI

A005228 Sequence and first differences (A030124) together list all positive numbers exactly once.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A167151 a(2n+1) = a(2n) + a(2n-1), a(2n)=least number not yet in the sequence, a(1)=1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula