A005150 -id:A005150 - cp's OEIS frontend

A047842 Describe n (count digits in order of increasing value, ignoring missing digits).

10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1011, 21, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1012, 1112, 22, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1013, 1113, 1213, 23, 1314, 1315, 1316, 1317, 1318, 1319, 1014, 1114, 1214, 1314, 24, 1415, 1416

Offset: 0

N. J. A. Sloane

Digit count of n. The digit count numerically summarizes the frequency of digits 0 through 9 in that order when they occur in a number. - Lekraj Beedassy, Jan 11 2007

Numbers which are digital permutations of one another have the same digit count. Compare with first entries of "Look And Say" or LS sequence A045918. As in the latter, a(n) has first odd-numbered-digit entry occurring at n=1111111111 with digit count 101, but a(n) has first ambiguous term 1011. For digit count invariants, i.e., n such that a(n)=n, see A047841. - Lekraj Beedassy, Jan 11 2007

			a(31) = 1113 because (one 1, one 3) make up 31.
101 contains one 0 and two 1's, so a(101) = 1021.
a(131) = 2113.
For n = 20231231, the digits of the date 2023-12-31, last day of 2023, a(n) = 10213223 is a fixed point: a(a(n)) = a(n) (cf. A235775). Since a(n) is invariant under permutation of the digits of n (leading zeros avoided), this is independent of the chosen notation, yyyy-mm-dd or mm/dd/yyyy or dd.mm.yyyy. - _M. F. Hasler_, Jan 11 2024

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Onno M. Cain and Sela T. Enin, Inventory Loops (i.e. Counting Sequences) have Pre-period 2 max S_1 + 60, arXiv:2004.00209 [math.NT], 2020.
Andre Kowacs, Studies on the Pea Pattern Sequence, arXiv:1708.06452 [math.HO], 2017.

Cf. A005151, A047841, A047843, A127354, A127355.
Cf. A235775.
Cf. A244112 (the same but in order of decreasing value of digits), A010785.
Cf. A005150 (Look and Say: describe the number digit-wise instead of overall count).
Cf. A328447 (least m having the same digits as n).

import Data.List (sort, group); import Data.Function (on)
a047842 :: Integer -> Integer
a047842 n = read $ concat $
   zipWith ((++) `on` show) (map length xs) (map head xs)
   where xs = group $ sort $ map (read . return) $ show n
-- Reinhard Zumkeller, Jan 15 2014

dc[n_] :=FromDigits@Flatten@Select[Table[{DigitCount[n, 10, k], k}, {k, 0, 9}], #[[1]] > 0 &];Table[dc[n], {n, 0, 46}] (* Ray Chandler, Jan 09 2009 *)
Array[FromDigits@ Flatten@ Map[Reverse, Tally@ Sort@ IntegerDigits@ #] &, 46] (* Michael De Vlieger, Jul 15 2020 *)

A047842(n)={if(n, local(c=1, S="", d=vecsort(digits(n)), a(i)=Str(S, c, d[i])); for(i=2, #d, if(d[i]==d[i-1], c++, S=a(i-1); c=1)); eval(a(#d)), 10)} \\ M. F. Hasler, Feb 25 2018; edited Jan 10 2024

def A047842(n):
    s, x = '', str(n)
    for i in range(10):
        y = str(i)
        c = str(x.count(y))
        if c != '0':
            s += c+y
    return int(s) # Chai Wah Wu, Jan 03 2015

a(a(n)) = A235775(n). [By definition of A235775. - M. F. Hasler, Jan 11 2024]
a(A010785(n)) = A244112(A010785(n)). - Reinhard Zumkeller, Nov 11 2014
a(n) = a(A328447(n)) = a(m) for all n and all m having the same digits as n, with multiplicity. - M. F. Hasler, Jan 11 2024

Edited by N. J. A. Sloane, Jul 03 2008 at the suggestion of R. J. Mathar

A006715 Describe the previous term! (method A - initial term is 3).

Original entry on oeis.org

3, 13, 1113, 3113, 132113, 1113122113, 311311222113, 13211321322113, 1113122113121113222113, 31131122211311123113322113, 132113213221133112132123222113, 11131221131211132221232112111312111213322113, 31131122211311123113321112131221123113111231121123222113

Offset: 1

N. J. A. Sloane

Method A = 'frequency' followed by 'digit'-indication.

a(n+1) - a(n) is divisible by 10^5 for n > 5. - Altug Alkan, Dec 04 2015

			The term after 3113 is obtained by saying "one 3, two 1's, one 3", which gives 132113.

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.

T. D. Noe, Table of n, a(n) for n=1..20
Éric Brier, Rémi Géraud-Stewart, David Naccache, Alessandro Pacco, and Emanuele Troiani, Stuttering Conway Sequences Are Still Conway Sequences, arXiv:2006.06837 [math.DS], 2020.
Éric Brier, Rémi Géraud-Stewart, David Naccache, Alessandro Pacco, and Emanuele Troiani, The Look-and-Say The Biggest Sequence Eventually Cycles, arXiv:2006.07246 [math.DS], 2020.
J. H. Conway, The weird and wonderful chemistry of audioactive decay, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 173-188.
S. R. Finch, Conway's Constant [Broken link]
S. R. Finch, Conway's Constant [From the Wayback Machine]
Eric Weisstein's World of Mathematics, Look and Say Sequence.

Cf. A001140, A001141, A001143, A001145, A001151, A001154, A001155, A005150, A006751.

Cf. A088204 (continuous version).

RunLengthEncode[ x_List ] := (Through[ {First, Length}[ #1 ] ] &) /@ Split[ x ]; LookAndSay[ n_, d_:1 ] := NestList[ Flatten[ Reverse /@ RunLengthEncode[ # ] ] &, {d}, n - 1 ]; F[ n_ ] := LookAndSay[ n, 3 ][ [ n ] ]; Table[ FromDigits[ F[ n ] ], {n, 11} ] (* Zerinvary Lajos, Mar 21 2007 *)

# This outputs the first n elements of the sequence, where n is given on the command line.
$s = 3;
for (2..shift @ARGV) {
    print "$s, ";
    $s =~ s/(.)\1*/(length $&).$1/eg;
}
print "$s\n";
## Arne 'Timwi' Heizmann (timwi(AT)gmx.net), Mar 12 2008

A006711 Describe previous term from the right (method A - initial term is 1).

Original entry on oeis.org

1, 11, 21, 1112, 1231, 11131211, 2112111331, 112331122112, 12212221231221, 11221113121132112211, 212221121321121113312221, 113211233112211213111221321112

Offset: 1

N. J. A. Sloane

Method A = 'frequency' followed by 'digit'-indication.

			E.g. the term after 1231 is obtained by saying "one 1, one 3, one 2, one 1", which gives 11131211.

J. H. Conway, personal communication.
Akhlesh Lakhtakia and C. A. Pickover, Observations on the Gleichniszahlen-Reihe: An Unusual Number Theory Sequence, J. Rec. Math., Vol. 25 #3, pp. 189-192, 1993.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Reinhard Zumkeller, Table of n, a(n) for n = 1..24
Onno M. Cain, Sela T. Enin, Inventory Loops (i.e. Counting Sequences) have Pre-period 2 max S_1 + 60, arXiv:2004.00209 [math.NT], 2020.
Trevor Scheopner, The Cyclic Nature (and Other Intriguing Properties) of Descriptive Numbers, Princeton Undergraduate Mathematics Journal, Issue 1, Article 4.
Eric Weisstein's World of Mathematics, Look and Say Sequence
Wikipedia, Look-and-say sequence

Cf. A005150, A022506, A022482, A022507-A022513.

a006711 n = a006711_list !! (n-1)
a006711_list = iterate (a045918 . a004086) 1
-- Reinhard Zumkeller, Mar 02 2014

A006711[1]:=1;A006711[n_]:=A006711[n]=FromDigits[Flatten[{Length[#],First[#]}&/@Split[Reverse[IntegerDigits[A006711[n-1]]]]]];Map[A006711,Range[15]] (* Peter J. C. Moses, Apr 22 2013 *)

a(n+1) = A045918(A004086(a(n))). - Reinhard Zumkeller, Mar 02 2014

A007651 Describe the previous term! (method B - initial term is 1).

Original entry on oeis.org

1, 11, 12, 1121, 122111, 112213, 12221131, 1123123111, 12213111213113, 11221131132111311231, 12221231123121133112213111, 1123112131122131112112321222113113, 1221311221113112221131132112213121112312311231

Offset: 1

N. J. A. Sloane

Method B = 'digit'-indication followed by 'frequency'.

			The term after 1121 is obtained by saying "1 twice, 2 once, 1 once", which gives 122111.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Reinhard Zumkeller, Table of n, a(n) for n = 1..25

Cf. A005150, A022470, A022499, A022500-A022505.

a007651 = foldl1 (\v d -> 10 * v + d) . map toInteger . a220424_row
-- Reinhard Zumkeller, Dec 15 2012

RunLengthEncode[ x_List ] := (Through[ {First, Length}[ #1 ] ] &) /@ Split[ x ]; LookAndSay[ n_, d_:1 ] := NestList[ Flatten[ Reverse /@ RunLengthEncode[ # ] ] &, {d}, n - 1 ]; F[ n_ ] := LookAndSay[ n, 1 ][ [ n ] ]; Table[ FromDigits[ Reverse[ F[ n ] ] ], {n, 1, 15} ]
a[1] = 1; a[n_] := a[n] = FromDigits[Flatten[{First[#], Length[#]}&/@Split[IntegerDigits[a[n-1]]]]]; Map[a, Range[25]] (* Peter J. C. Moses, Mar 22 2013 *)

from itertools import accumulate, groupby, repeat
def summarize(n, _): return int("".join(k+str(len(list(g))) for k, g in groupby(str(n))))
def aupto(terms): return list(accumulate(repeat(1, terms), summarize))
print(aupto(13)) # Michael S. Branicky, Sep 18 2022

a(n) = Sum_{k=1..A005341(n)} A220424(n,k)*10^(A005341(n)-k). - Reinhard Zumkeller, Dec 15 2012

A063850 Say what you see in previous term, reporting total number for each digit encountered.

Original entry on oeis.org

1, 11, 21, 1211, 3112, 132112, 311322, 232122, 421311, 14123113, 41141223, 24312213, 32142321, 23322114, 32232114, 23322114, 32232114, 23322114, 32232114, 23322114, 32232114, 23322114, 32232114, 23322114, 32232114

Offset: 0

N. J. A. Sloane, Aug 25 2001

The digits of each term a(n) are a permutation of those of the corresponding term A005151(n). - Chayim Lowen, Jul 16 2015

			To get the term after 311322, we say: two 3's, two 1's, two 2's, so 232122.

A variant of A005150, A005151, etc.

deldup[ lst_ ] := Module[ {i, s}, s={}; For[ i=1, i<=Length[ lst ], i++, If[ !MemberQ[ s, lst[ [ i ] ] ], AppendTo[ s, lst[ [ i ] ] ] ] ]; s ]; next[ term_ ] := FromDigits[ Flatten[ ({Count[ IntegerDigits[ term ], # ], #}&)/@deldup[ IntegerDigits[ term ] ] ] ]

from collections import Counter; s = '1'
for _ in range(25):
    print(s, end = ', '); d = Counter(s); s = ''
    for k, v in d.items(): s += str(v) + k  # Ya-Ping Lu, Jun 06 2025

After a while sequence has period 2.

Corrected and extended by Dean Hickerson, Aug 27 2001

A001155 Describe the previous term! (method A - initial term is 0).

Original entry on oeis.org

0, 10, 1110, 3110, 132110, 1113122110, 311311222110, 13211321322110, 1113122113121113222110, 31131122211311123113322110, 132113213221133112132123222110, 11131221131211132221232112111312111213322110, 31131122211311123113321112131221123113111231121123222110

Offset: 1

N. J. A. Sloane

Method A = 'frequency' followed by 'digit'-indication.
a(n), A001140, A001141, A001143, A001145, A001151 and A001154 are all identical apart from the last digit of each term (the seed). This is because digits other than 1, 2 and 3 never arise elsewhere in the terms (other than at the end of each of them) of look-and-say sequences of this type (as is mentioned by Carmine Suriano in A006751). - Chayim Lowen, Jul 16 2015
a(n+1) - a(n) is divisible by 10^5 for n > 5. - Altug Alkan, Dec 04 2015

			The term after 3110 is obtained by saying "one 3, two 1's, one 0", which gives 132110.

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.

T. D. Noe, Table of n, a(n) for n=1..20
J. H. Conway, The weird and wonderful chemistry of audioactive decay, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 173-188.
S. R. Finch, Conway's Constant [Broken link]
S. R. Finch, Conway's Constant [From the Wayback Machine]

Cf. A005150, A006751, A006715, A001140, A001141, A001143, A001145, A001151, A001154.

Cf. A036058.

A001155[1] := 0; A001155[n_] := A001155[n] = FromDigits[Flatten[{Length[#], First[#]}&/@Split[IntegerDigits[A001155[n-1]]]]]; Map[A001155,Range[15]] (* Peter J. C. Moses, Mar 21 2013 *)

A001155(n,a=0)={ while(n--, my(c=1); for(j=2,#a=Vec(Str(a)), if( a[j-1]==a[j], a[j-1]=""; c++, a[j-1]=Str(c,a[j-1]); c=1)); a[#a]=Str(c,a[#a]); a=concat(a)); a }  \\ M. F. Hasler, Jun 30 2011

from itertools import accumulate, groupby, repeat
def summarize(n, _): return int("".join(str(len(list(g)))+k for k, g in groupby(str(n))))
def aupton(terms): return list(accumulate(repeat(0, terms), summarize))
print(aupton(11)) # Michael S. Branicky, Jun 28 2022

A022513 Describe previous term from the right (method A - initial term is 9).

Original entry on oeis.org

9, 19, 1911, 211911, 21192112, 122112192112, 122112191112212211, 2122112231191112212211, 21221122311921132221221112, 12312211321321121921132221221112

Offset: 0

N. J. A. Sloane

Method A = 'frequency' followed by 'digit'-indication.

			E.g., the term after 1911 is obtained by saying "two 1's, one 9, one 1", which gives 211911.

Cf. A005150, A022506, A006711, A022482, A022507-A022512.

More terms from Erich Friedman

A001151 Describe the previous term! (method A - initial term is 8).

Original entry on oeis.org

8, 18, 1118, 3118, 132118, 1113122118, 311311222118, 13211321322118, 1113122113121113222118, 31131122211311123113322118, 132113213221133112132123222118, 11131221131211132221232112111312111213322118, 31131122211311123113321112131221123113111231121123222118

Offset: 1

N. J. A. Sloane

Method A = 'frequency' followed by 'digit'-indication.

a(n+1) - a(n) is divisible by 10^5 for n > 5. - Altug Alkan, Dec 04 2015

			E.g. the term after 3118 is obtained by saying "one 3, two 1's, one 8", which gives 132118.

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.

T. D. Noe, Table of n, a(n) for n=1..20
J. H. Conway, The weird and wonderful chemistry of audioactive decay, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 173-188.
S. R. Finch, Conway's Constant [Broken link]
S. R. Finch, Conway's Constant [From the Wayback Machine]

Cf. A001155, A005150, A006751, A006715, A001140, A001141, A001143, A001145, A001154.

freq := proc(i,L)
    local f,p ;
    if i > nops(L) or i < 1 then
        return 0 ;
    end if;
    f := 1 ;
    for p from i to 2 by -1 do
        if op(p,L) = op(p-1,L) then
            f := f+1 ;
        else
            return f;
        end if;
    end do:
    f ;
end proc:
read("transforms"):
rle := proc(n)
    local inL,i,outL,f ;
    inL := convert(n,base,10) ;
    i := nops(inL) ;
    outL := [] ;
    while i>0 do
        f := freq(i,inL) ;
        if f = 0 then
            break;
        else
            outL := [op(outL),f,op(i,inL)] ;
            i := i-f ;
        end if;
    end do:
    digcatL(outL) ;
end proc:
A001151 := proc(n)
    option remember ;
    if n = 1 then
        8;
    else
        rle(procname(n-1)) ;
    end if;
end proc:
seq(A001151(n),n=1..10) ; # R. J. Mathar, Feb 11 2021

RunLengthEncode[x_List] := (Through[{First, Length}[ #1]] &) /@ Split[x]; LookAndSay[n_, d_: 1] := NestList[Flatten[Reverse /@ RunLengthEncode[ # ]] &, {d}, n - 1]; F[n_] := LookAndSay[n, 8][[n]]; Table[FromDigits[F[n]], {n, 1, 11}] (* Zerinvary Lajos, Jul 08 2009 *)

A225224 A continuous "look-and-say" sequence (without repetition, seed 1,1,1).

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 3, 2, 1, 1, 3, 1, 2, 2, 1, 1, 3, 1, 1, 2, 2, 2, 1, 1, 3, 2, 1, 3, 2, 2, 1, 1, 3, 1, 2, 1, 1, 1, 3, 2, 2, 2, 1, 1, 3, 1, 1, 1, 2, 3, 1, 1, 3, 3, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 3, 2, 1, 2, 3, 2, 2, 2, 1, 2, 3, 2, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1

Offset: 1

Jean-Christophe Hervé, May 02 2013

A variant of the Conway's 'look-and-say' sequence A005150, without run cut-off. It describes at each step the preceding numbers taken altogether.
The sequence is better described as starting with three 1's: 1, 1, 1, and then 3, 1, and 1, 3, etc., as seed one creates a singular case: 1, then 1, 1, which can be continued either as 2, 1 (ignoring the aforesaid first 1, cf. A221646), or as 3, 1, considering twice the first one.
Contrary to the original look-and-say, this sequence is not base dependent, because figures or group of figures are not aggregated and read as numbers.
The sequence is determined by pairs. Terms of even ranks are counts while odd ranks are numbers.
As in the original look-and-say sequence, a(n) is always equal to 1, 2 or 3. The subsequence 3,3,3 never appears.
Two successive odd ranks cannot be equal, which implies that sequences of length three always begin on even rank and that two such sequences never follow each other.
Applying the look-and-say principle to the sequence itself, it is simply shift three ranks to the left.
With seed 2 (resp. 3), the sequence is A088203 (resp. A088204). These two sequences are shifted one rank left by the look-and-say transform.
With seed 2, the sequence A088203 is the concatenation of A006751 (original look-and-say method by blocks): this is because all blocks begin with 1 or 3 and end with 2 and therefore, there is no possible interaction between blocks after concatenation.

			The sequence starts with: 1, 1, 1
The first group has three 1's: 3, 1
The next group has one 3: 1, 3
The next group has two 1's: 2, 1
The next group has one 3: 1, 3
The next group has one 2: 1, 2
The next group has two 1's: 2, 1, etc.

J.-C. Hervé, Table of n, a(n) for n = 1..10000

Cf. A005150 (original look-and-say sequence).
Cf. A221646 (a close variant with seed 1).
Cf. A225212 (a variant with nested repetitions).
Cf. A088203 (seed 2), A088204 (seed 3).
Cf. A225330 (look-and-repeat).

/* computes first n terms in array a[] */
int *swys(int n) {
int a[n] ;
int see, say, c ;
a[0] = 1;
see = say = 0 ;
while( say < n-1 ) {
  c = 0 ;     /* count */
  dg = a[see] /* digit */
  if (say > 0) { /* not the first time */
    while (see <= say) {
      if (a[see]== dg)  c += 1 ;
      else break ;
      see += 1 ;
      }
    }
  else {
   c = 1 ;
    }
  a[++say] = c ;
  if (say < n-1) a[++say] = dg ;
  }
return(a);
}

n = 100; a[0] = 1; see = say = 0; While[ say < n - 1, c = 0; dg = a[see]; If[say > 0, While[ see <= say, If[a[see] == dg, c += 1, Break[]]; see += 1], c = 1]; a[++say] = c; If[say < n - 1, a[++say] = dg]]; Array[a, n, 0] (* Jean-François Alcover, Jul 11 2013, translated and adapted from J.-C. Hervé's C program *)

A001140 Describe the previous term! (method A - initial term is 4).

Original entry on oeis.org

4, 14, 1114, 3114, 132114, 1113122114, 311311222114, 13211321322114, 1113122113121113222114, 31131122211311123113322114, 132113213221133112132123222114, 11131221131211132221232112111312111213322114, 31131122211311123113321112131221123113111231121123222114

Offset: 1

N. J. A. Sloane

Method A = 'frequency' followed by 'digit'-indication.
A001155, A001140, A001141, A001143, A001145, A001151 and A001154 are all identical apart from the last digit of each term (the seed). This is because digits other than 1, 2 and 3 never arise elsewhere in the terms (other than at the end of each of them) of look-and-say sequences of this type (as is mentioned by Carmine Suriano in A006751). - Chayim Lowen, Jul 16 2015
a(n+1) - a(n) is divisible by 10^5 for n > 5. - Altug Alkan, Dec 04 2015

			The term after 3114 is obtained by saying "one 3, two 1's, one 4", which gives 132114.

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.

T. D. Noe, Table of n, a(n) for n=1..20
J. H. Conway, The weird and wonderful chemistry of audioactive decay, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 173-188.
S. R. Finch, Conway's Constant [Broken link]
S. R. Finch, Conway's Constant [From the Wayback Machine]

Cf. A001155, A005150, A006751, A006715, A001141, A001143, A001145, A001151, A001154.

cf. Josh Triplett's program for A005051.
import Data.List (group)
a001140 n = a001140_list !! (n-1)
a001140_list = 4 : map say a001140_list where
   say = read . concatMap saygroup . group . show
         where saygroup s = (show $ length s) ++ [head s]
-- Reinhard Zumkeller, Dec 15 2012

RunLengthEncode[ x_List ] := (Through[ {First, Length}[ #1 ] ] &) /@ Split[ x ];
LookAndSay[ n_, d_:1 ] := NestList[ Flatten[ Reverse /@ RunLengthEncode[ # ] ] &, {d}, n - 1 ];
F[ n_ ] := LookAndSay[ n, 4 ][ [ n ] ];
Table[ FromDigits[ F[ n ] ], {n, 1, 11} ] (* Zerinvary Lajos, Mar 21 2007 *)

# This outputs the first n elements of the sequence, where n is given on the command line.
$s = 4;
for (2..shift @ARGV) {
    print "$s, ";
    $s =~ s/(.)\1*/(length $&).$1/eg;
}
print "$s\n";
## Arne 'Timwi' Heizmann (timwi(AT)gmx.net), Mar 12 2008

cp's OEIS Frontend

A047842 Describe n (count digits in order of increasing value, ignoring missing digits).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

Extensions

A006715 Describe the previous term! (method A - initial term is 3).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Perl

A006711 Describe previous term from the right (method A - initial term is 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A007651 Describe the previous term! (method B - initial term is 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Formula

A063850 Say what you see in previous term, reporting total number for each digit encountered.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A001155 Describe the previous term! (method A - initial term is 0).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Python