<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>jeneshicc</author_name>
  <author_url>https://blog.hatena.ne.jp/jeneshicc/</author_url>
  <blog_title>落書き、時々落学</blog_title>
  <blog_url>https://jeneshicc.hatenadiary.org/</blog_url>
  <categories>
    <anon>Project Euler</anon>
  </categories>
  <description>The Fibonacci sequence is defined by the recurrence relation: Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1.Hence the first 12 terms will be: F1 = 1 F2 = 1 F3 = 2 F4 = 3 F5 = 5 F6 = 8 F7 = 13 F8 = 21 F9 = 34 F10 = 55 F11 = 89 F12 = 144The 12th term, F12, is the first term to contain three digits.What is t…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081029%2F1225256033&quot; title=&quot;Problem 25 - 落書き、時々落学&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2008-10-29 13:53:53</published>
  <title>Problem 25</title>
  <type>rich</type>
  <url>https://jeneshicc.hatenadiary.org/entry/20081029/1225256033</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
