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.

A081829 Numbers n such that the n-th term of Hofstadter Q-sequence is > (n+1)-th term.

This page as a plain text file.
%I A081829 #15 Feb 16 2025 08:32:48
%S A081829 15,24,31,35,38,48,51,52,55,57,63,64,66,67,70,73,75,77,81,84,88,96,
%T A081829 100,103,105,109,112,115,118,119,121,124,126,127,128,130,135,138,140,
%U A081829 141,143,144,147,149,150,152,155,158,160,162,165,168,169,171,172,174,179
%N A081829 Numbers n such that the n-th term of Hofstadter Q-sequence is > (n+1)-th term.
%C A081829 A005185(a(n)+1) < A005185(a(n)); A081827(a(n)) < 0.
%H A081829 Reinhard Zumkeller, <a href="/A081829/b081829.txt">Table of n, a(n) for n = 1..10000</a>
%H A081829 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HofstadtersQ-Sequence.html">Hofstadter's Q-Sequence</a>
%H A081829 Wikipedia, <a href="http://en.wikipedia.org/wiki/Hofstadter_sequence">Hofstadter sequence</a>
%H A081829 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a>
%F A081829 Conjecture : a(n)/n>2 and a(n)/n->2
%o A081829 (Haskell)
%o A081829 import Data.List (findIndices)
%o A081829 a08182 n = a081829_list !! (n-1)
%o A081829 a081829_list = map (+ 1) $ findIndices (< 0) a081827_list
%o A081829 -- _Reinhard Zumkeller_, Sep 15 2011
%Y A081829 Cf. A081828, A081830, A194626.
%K A081829 nonn
%O A081829 1,1
%A A081829 _Benoit Cloitre_, Apr 10 2003