mathworld.wolfram.com/Self-CountingSequence.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

7

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/Self-CountingSequence.html

Self-Counting Sequence -- from Wolfram MathWorld

The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).



Bing

Self-Counting Sequence -- from Wolfram MathWorld

https://mathworld.wolfram.com/Self-CountingSequence.html

The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).



DuckDuckGo

https://mathworld.wolfram.com/Self-CountingSequence.html

Self-Counting Sequence -- from Wolfram MathWorld

The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).

  • General Meta Tags

    22
    • title
      Self-Counting Sequence -- from Wolfram MathWorld
    • DC.Title
      Self-Counting Sequence
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).
    • description
      The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_Self-CountingSequence.png
    • og:url
      https://mathworld.wolfram.com/Self-CountingSequence.html
    • og:type
      website
    • og:title
      Self-Counting Sequence -- from Wolfram MathWorld
    • og:description
      The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Self-Counting Sequence -- from Wolfram MathWorld
    • twitter:description
      The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas for the nth term a(n), a(n) = |_1/2+sqrt(2n)_| (1) = [1/2(sqrt(8n+1)-1)], (2) where |_x_| is the floor function and [x] is the ceiling function (Graham et al. 1994, p. 97). The sequence is also given by the recursive sequence a(n)=1+a(n-a(n-1)) (3) (Wolfram 2002, p. 129).
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_Self-CountingSequence.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/Self-CountingSequence.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

43